./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 3d056a1f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/lcp.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-3d056a1 [2019-11-22 14:30:03,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:30:03,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:30:03,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:30:03,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:30:03,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:30:03,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:30:03,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:30:03,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:30:03,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:30:03,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:30:03,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:30:03,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:30:03,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:30:03,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:30:03,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:30:03,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:30:03,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:30:03,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:30:03,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:30:03,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:30:03,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:30:03,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:30:03,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:30:03,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:30:03,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:30:03,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:30:03,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:30:03,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:30:03,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:30:03,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:30:03,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:30:03,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:30:03,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:30:03,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:30:03,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:30:03,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:30:03,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:30:03,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:30:03,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:30:03,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:30:03,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-22 14:30:03,665 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:30:03,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:30:03,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:30:03,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:30:03,667 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:30:03,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:30:03,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 14:30:03,668 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:30:03,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:30:03,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 14:30:03,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:30:03,669 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:30:03,669 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:30:03,669 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 14:30:03,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:30:03,670 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:30:03,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 14:30:03,670 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:30:03,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:30:03,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:30:03,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:30:03,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:30:03,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:30:03,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:30:03,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:30:03,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 14:30:03,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 14:30:03,673 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-22 14:30:03,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:30:03,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:30:04,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:30:04,001 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:30:04,002 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:30:04,002 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/lcp.c [2019-11-22 14:30:04,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6045e6189/7f4faaccebf443b9b2f6073e34d261ff/FLAG762315a56 [2019-11-22 14:30:04,534 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:30:04,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2019-11-22 14:30:04,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6045e6189/7f4faaccebf443b9b2f6073e34d261ff/FLAG762315a56 [2019-11-22 14:30:04,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6045e6189/7f4faaccebf443b9b2f6073e34d261ff [2019-11-22 14:30:04,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:30:04,926 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:30:04,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:30:04,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:30:04,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:30:04,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:30:04" (1/1) ... [2019-11-22 14:30:04,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3143ee76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:04, skipping insertion in model container [2019-11-22 14:30:04,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:30:04" (1/1) ... [2019-11-22 14:30:04,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:30:04,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:30:05,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:30:05,191 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 14:30:05,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:30:05,299 INFO L208 MainTranslator]: Completed translation [2019-11-22 14:30:05,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:05 WrapperNode [2019-11-22 14:30:05,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:30:05,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 14:30:05,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 14:30:05,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 14:30:05,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:05" (1/1) ... [2019-11-22 14:30:05,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:05" (1/1) ... [2019-11-22 14:30:05,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:05" (1/1) ... [2019-11-22 14:30:05,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:05" (1/1) ... [2019-11-22 14:30:05,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:05" (1/1) ... [2019-11-22 14:30:05,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:05" (1/1) ... [2019-11-22 14:30:05,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:05" (1/1) ... [2019-11-22 14:30:05,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 14:30:05,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 14:30:05,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 14:30:05,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 14:30:05,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:30:05,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 14:30:05,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 14:30:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 14:30:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2019-11-22 14:30:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-22 14:30:05,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 14:30:05,401 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 14:30:05,401 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 14:30:05,401 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 14:30:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 14:30:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 14:30:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 14:30:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 14:30:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2019-11-22 14:30:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 14:30:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-22 14:30:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 14:30:05,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 14:30:05,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 14:30:05,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 14:30:05,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 14:30:05,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:30:05,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 14:30:05,814 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:30:05,814 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 14:30:05,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:30:05 BoogieIcfgContainer [2019-11-22 14:30:05,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:30:05,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:30:05,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:30:05,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:30:05,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:30:04" (1/3) ... [2019-11-22 14:30:05,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439edf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:30:05, skipping insertion in model container [2019-11-22 14:30:05,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:05" (2/3) ... [2019-11-22 14:30:05,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439edf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:30:05, skipping insertion in model container [2019-11-22 14:30:05,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:30:05" (3/3) ... [2019-11-22 14:30:05,824 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-11-22 14:30:05,832 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:30:05,837 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-22 14:30:05,847 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-22 14:30:05,866 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:30:05,866 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 14:30:05,867 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:30:05,867 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:30:05,867 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:30:05,867 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:30:05,867 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:30:05,867 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:30:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-22 14:30:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 14:30:05,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:05,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:05,894 INFO L410 AbstractCegarLoop]: === Iteration 1 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:05,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:05,900 INFO L82 PathProgramCache]: Analyzing trace with hash 992921340, now seen corresponding path program 1 times [2019-11-22 14:30:05,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:05,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654638872] [2019-11-22 14:30:05,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:06,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654638872] [2019-11-22 14:30:06,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:06,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 14:30:06,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478051501] [2019-11-22 14:30:06,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:30:06,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:06,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:30:06,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:30:06,232 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 8 states. [2019-11-22 14:30:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:06,726 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-11-22 14:30:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 14:30:06,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-22 14:30:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:06,745 INFO L225 Difference]: With dead ends: 60 [2019-11-22 14:30:06,746 INFO L226 Difference]: Without dead ends: 57 [2019-11-22 14:30:06,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-22 14:30:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-22 14:30:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-22 14:30:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-22 14:30:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-22 14:30:06,812 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 16 [2019-11-22 14:30:06,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:06,813 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-22 14:30:06,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:30:06,813 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-22 14:30:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 14:30:06,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:06,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:06,816 INFO L410 AbstractCegarLoop]: === Iteration 2 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash 992921341, now seen corresponding path program 1 times [2019-11-22 14:30:06,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:06,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251024049] [2019-11-22 14:30:06,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:07,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251024049] [2019-11-22 14:30:07,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:07,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 14:30:07,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036288276] [2019-11-22 14:30:07,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:30:07,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:07,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:30:07,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:30:07,122 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 10 states. [2019-11-22 14:30:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:07,726 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-22 14:30:07,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:30:07,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-22 14:30:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:07,730 INFO L225 Difference]: With dead ends: 70 [2019-11-22 14:30:07,730 INFO L226 Difference]: Without dead ends: 70 [2019-11-22 14:30:07,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-22 14:30:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-22 14:30:07,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-11-22 14:30:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-22 14:30:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-22 14:30:07,752 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-11-22 14:30:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:07,753 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-22 14:30:07,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:30:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-22 14:30:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 14:30:07,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:07,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:07,755 INFO L410 AbstractCegarLoop]: === Iteration 3 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash 715790491, now seen corresponding path program 1 times [2019-11-22 14:30:07,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:07,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155522914] [2019-11-22 14:30:07,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:08,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155522914] [2019-11-22 14:30:08,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:08,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 14:30:08,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403940576] [2019-11-22 14:30:08,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:30:08,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:08,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:30:08,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:30:08,055 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 10 states. [2019-11-22 14:30:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:08,650 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-22 14:30:08,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:30:08,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-22 14:30:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:08,652 INFO L225 Difference]: With dead ends: 69 [2019-11-22 14:30:08,653 INFO L226 Difference]: Without dead ends: 69 [2019-11-22 14:30:08,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-22 14:30:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-22 14:30:08,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-22 14:30:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-22 14:30:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-22 14:30:08,661 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 17 [2019-11-22 14:30:08,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:08,662 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-22 14:30:08,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:30:08,662 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-22 14:30:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 14:30:08,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:08,663 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:08,664 INFO L410 AbstractCegarLoop]: === Iteration 4 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:08,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:08,664 INFO L82 PathProgramCache]: Analyzing trace with hash 688616144, now seen corresponding path program 1 times [2019-11-22 14:30:08,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:08,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292735971] [2019-11-22 14:30:08,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:08,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292735971] [2019-11-22 14:30:08,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:08,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 14:30:08,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768960533] [2019-11-22 14:30:08,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:30:08,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:08,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:30:08,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:30:08,722 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-22 14:30:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:08,919 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-22 14:30:08,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:30:08,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-22 14:30:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:08,921 INFO L225 Difference]: With dead ends: 61 [2019-11-22 14:30:08,921 INFO L226 Difference]: Without dead ends: 61 [2019-11-22 14:30:08,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:30:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-22 14:30:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-22 14:30:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-22 14:30:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-22 14:30:08,928 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 19 [2019-11-22 14:30:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:08,928 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-22 14:30:08,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:30:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-22 14:30:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 14:30:08,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:08,929 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:08,930 INFO L410 AbstractCegarLoop]: === Iteration 5 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:08,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash -333529585, now seen corresponding path program 1 times [2019-11-22 14:30:08,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:08,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066838503] [2019-11-22 14:30:08,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:09,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066838503] [2019-11-22 14:30:09,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352559378] [2019-11-22 14:30:09,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:09,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-22 14:30:09,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:09,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 14:30:09,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:09,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:09,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:09,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 14:30:09,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:09,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:09,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:30:09,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-22 14:30:09,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771992840] [2019-11-22 14:30:09,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-22 14:30:09,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:09,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-22 14:30:09,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-22 14:30:09,635 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 19 states. [2019-11-22 14:30:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:10,449 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-11-22 14:30:10,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 14:30:10,449 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-11-22 14:30:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:10,451 INFO L225 Difference]: With dead ends: 69 [2019-11-22 14:30:10,451 INFO L226 Difference]: Without dead ends: 69 [2019-11-22 14:30:10,452 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-22 14:30:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-22 14:30:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-22 14:30:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-22 14:30:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-22 14:30:10,458 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 22 [2019-11-22 14:30:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:10,458 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-22 14:30:10,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-22 14:30:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-22 14:30:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 14:30:10,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:10,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:10,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:10,664 INFO L410 AbstractCegarLoop]: === Iteration 6 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:10,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash -578852278, now seen corresponding path program 1 times [2019-11-22 14:30:10,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:10,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703584159] [2019-11-22 14:30:10,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:10,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703584159] [2019-11-22 14:30:10,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:10,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 14:30:10,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943776184] [2019-11-22 14:30:10,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 14:30:10,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:10,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 14:30:10,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:30:10,782 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 9 states. [2019-11-22 14:30:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:11,098 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-22 14:30:11,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 14:30:11,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-22 14:30:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:11,100 INFO L225 Difference]: With dead ends: 69 [2019-11-22 14:30:11,101 INFO L226 Difference]: Without dead ends: 62 [2019-11-22 14:30:11,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-22 14:30:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-22 14:30:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-22 14:30:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-22 14:30:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-22 14:30:11,106 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 23 [2019-11-22 14:30:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:11,107 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-22 14:30:11,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 14:30:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-22 14:30:11,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 14:30:11,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:11,108 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:11,109 INFO L410 AbstractCegarLoop]: === Iteration 7 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:11,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:11,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1749482551, now seen corresponding path program 1 times [2019-11-22 14:30:11,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:11,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480616675] [2019-11-22 14:30:11,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:11,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480616675] [2019-11-22 14:30:11,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406023158] [2019-11-22 14:30:11,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:11,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-22 14:30:11,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:11,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 14:30:11,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:11,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:11,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:11,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 14:30:11,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:11,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:11,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:30:11,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-22 14:30:11,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686845334] [2019-11-22 14:30:11,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-22 14:30:11,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:11,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-22 14:30:11,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-22 14:30:11,663 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 19 states. [2019-11-22 14:30:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:12,612 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-22 14:30:12,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 14:30:12,612 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-11-22 14:30:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:12,613 INFO L225 Difference]: With dead ends: 64 [2019-11-22 14:30:12,614 INFO L226 Difference]: Without dead ends: 64 [2019-11-22 14:30:12,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-11-22 14:30:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-22 14:30:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-22 14:30:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-22 14:30:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-22 14:30:12,627 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 23 [2019-11-22 14:30:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:12,627 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-22 14:30:12,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-22 14:30:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-22 14:30:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-22 14:30:12,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:12,629 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:12,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:12,835 INFO L410 AbstractCegarLoop]: === Iteration 8 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:12,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:12,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156168, now seen corresponding path program 1 times [2019-11-22 14:30:12,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:12,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26438633] [2019-11-22 14:30:12,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 14:30:12,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26438633] [2019-11-22 14:30:12,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:12,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 14:30:12,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911247969] [2019-11-22 14:30:12,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:30:12,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:30:12,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:30:12,929 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 8 states. [2019-11-22 14:30:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:13,171 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-22 14:30:13,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 14:30:13,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-22 14:30:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:13,173 INFO L225 Difference]: With dead ends: 57 [2019-11-22 14:30:13,173 INFO L226 Difference]: Without dead ends: 57 [2019-11-22 14:30:13,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-22 14:30:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-22 14:30:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-22 14:30:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-22 14:30:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-22 14:30:13,188 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 29 [2019-11-22 14:30:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:13,188 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-22 14:30:13,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:30:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-22 14:30:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-22 14:30:13,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:13,192 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:13,192 INFO L410 AbstractCegarLoop]: === Iteration 9 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:13,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:13,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156167, now seen corresponding path program 1 times [2019-11-22 14:30:13,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:13,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569930334] [2019-11-22 14:30:13,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:13,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569930334] [2019-11-22 14:30:13,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114206959] [2019-11-22 14:30:13,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:13,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 14:30:13,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:13,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 14:30:13,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:13,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:13,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:13,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 14:30:13,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:13,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:16,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:30:16,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-22 14:30:16,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876401735] [2019-11-22 14:30:16,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-22 14:30:16,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:16,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-22 14:30:16,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-22 14:30:16,034 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2019-11-22 14:30:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:18,472 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-11-22 14:30:18,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 14:30:18,473 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-11-22 14:30:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:18,475 INFO L225 Difference]: With dead ends: 59 [2019-11-22 14:30:18,475 INFO L226 Difference]: Without dead ends: 59 [2019-11-22 14:30:18,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=260, Invalid=1461, Unknown=1, NotChecked=0, Total=1722 [2019-11-22 14:30:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-22 14:30:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-11-22 14:30:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-22 14:30:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-11-22 14:30:18,481 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 29 [2019-11-22 14:30:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:18,481 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-11-22 14:30:18,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-22 14:30:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-11-22 14:30:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 14:30:18,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:18,483 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:18,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:18,686 INFO L410 AbstractCegarLoop]: === Iteration 10 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1740200963, now seen corresponding path program 1 times [2019-11-22 14:30:18,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:18,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901358112] [2019-11-22 14:30:18,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:18,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901358112] [2019-11-22 14:30:18,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854016771] [2019-11-22 14:30:18,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:18,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 14:30:19,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:19,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 14:30:19,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:19,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:19,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:19,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 14:30:19,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:19,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:21,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:30:21,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-22 14:30:21,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361162078] [2019-11-22 14:30:21,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-22 14:30:21,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:21,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-22 14:30:21,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-22 14:30:21,530 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2019-11-22 14:30:22,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:22,939 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-11-22 14:30:22,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 14:30:22,940 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-11-22 14:30:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:22,942 INFO L225 Difference]: With dead ends: 58 [2019-11-22 14:30:22,942 INFO L226 Difference]: Without dead ends: 58 [2019-11-22 14:30:22,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 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-22 14:30:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-22 14:30:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-11-22 14:30:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-22 14:30:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-11-22 14:30:22,948 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2019-11-22 14:30:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:22,949 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-11-22 14:30:22,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-22 14:30:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-11-22 14:30:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-22 14:30:22,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:22,951 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:23,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:23,154 INFO L410 AbstractCegarLoop]: === Iteration 11 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash 35373901, now seen corresponding path program 1 times [2019-11-22 14:30:23,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:23,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147763162] [2019-11-22 14:30:23,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 14:30:23,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147763162] [2019-11-22 14:30:23,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588082541] [2019-11-22 14:30:23,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:23,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-22 14:30:23,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:23,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 14:30:23,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:23,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:23,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:23,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 14:30:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:23,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 14:30:23,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-22 14:30:23,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353936156] [2019-11-22 14:30:23,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 14:30:23,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 14:30:23,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-22 14:30:23,920 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 13 states. [2019-11-22 14:30:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:24,357 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-22 14:30:24,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-22 14:30:24,358 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-11-22 14:30:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:24,359 INFO L225 Difference]: With dead ends: 56 [2019-11-22 14:30:24,359 INFO L226 Difference]: Without dead ends: 56 [2019-11-22 14:30:24,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-11-22 14:30:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-22 14:30:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-11-22 14:30:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-22 14:30:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-22 14:30:24,363 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 38 [2019-11-22 14:30:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:24,365 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-22 14:30:24,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 14:30:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-22 14:30:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-22 14:30:24,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:24,366 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:24,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:24,569 INFO L410 AbstractCegarLoop]: === Iteration 12 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:24,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:24,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1096590900, now seen corresponding path program 1 times [2019-11-22 14:30:24,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:24,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420121763] [2019-11-22 14:30:24,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 14:30:24,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420121763] [2019-11-22 14:30:24,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071672440] [2019-11-22 14:30:24,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:24,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-22 14:30:24,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:24,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 14:30:24,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:24,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:24,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:24,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 14:30:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:25,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 14:30:25,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-22 14:30:25,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806346124] [2019-11-22 14:30:25,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 14:30:25,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:25,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 14:30:25,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-22 14:30:25,373 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 13 states. [2019-11-22 14:30:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:25,821 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-11-22 14:30:25,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-22 14:30:25,822 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-22 14:30:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:25,823 INFO L225 Difference]: With dead ends: 55 [2019-11-22 14:30:25,823 INFO L226 Difference]: Without dead ends: 55 [2019-11-22 14:30:25,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-11-22 14:30:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-22 14:30:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-22 14:30:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-22 14:30:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-22 14:30:25,827 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 39 [2019-11-22 14:30:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:25,828 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-22 14:30:25,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 14:30:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-22 14:30:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-22 14:30:25,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:25,830 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:26,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:26,031 INFO L410 AbstractCegarLoop]: === Iteration 13 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:26,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:26,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1566484332, now seen corresponding path program 1 times [2019-11-22 14:30:26,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:26,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501572768] [2019-11-22 14:30:26,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 14:30:26,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501572768] [2019-11-22 14:30:26,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:26,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 14:30:26,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119153693] [2019-11-22 14:30:26,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:30:26,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:26,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:30:26,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:30:26,106 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 6 states. [2019-11-22 14:30:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:26,252 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-22 14:30:26,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:30:26,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-22 14:30:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:26,254 INFO L225 Difference]: With dead ends: 52 [2019-11-22 14:30:26,254 INFO L226 Difference]: Without dead ends: 52 [2019-11-22 14:30:26,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:30:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-22 14:30:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-22 14:30:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-22 14:30:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-11-22 14:30:26,258 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 41 [2019-11-22 14:30:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:26,259 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-11-22 14:30:26,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:30:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-11-22 14:30:26,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-22 14:30:26,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:26,260 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:26,260 INFO L410 AbstractCegarLoop]: === Iteration 14 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:30:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:26,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2142076529, now seen corresponding path program 1 times [2019-11-22 14:30:26,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:26,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869468603] [2019-11-22 14:30:26,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 14:30:26,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869468603] [2019-11-22 14:30:26,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:26,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:30:26,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460791534] [2019-11-22 14:30:26,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:30:26,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:26,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:30:26,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:30:26,378 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2019-11-22 14:30:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:26,568 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-11-22 14:30:26,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:30:26,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-22 14:30:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:26,570 INFO L225 Difference]: With dead ends: 51 [2019-11-22 14:30:26,570 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 14:30:26,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:30:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 14:30:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 14:30:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 14:30:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 14:30:26,571 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-22 14:30:26,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:26,572 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 14:30:26,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:30:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 14:30:26,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 14:30:26,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:30:26 BoogieIcfgContainer [2019-11-22 14:30:26,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 14:30:26,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 14:30:26,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 14:30:26,578 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 14:30:26,579 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:30:05" (3/4) ... [2019-11-22 14:30:26,582 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 14:30:26,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 14:30:26,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lcp [2019-11-22 14:30:26,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 14:30:26,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 14:30:26,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-22 14:30:26,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 14:30:26,596 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-22 14:30:26,596 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-22 14:30:26,597 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-22 14:30:26,597 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 14:30:26,656 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 14:30:26,656 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 14:30:26,658 INFO L168 Benchmark]: Toolchain (without parser) took 21732.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -220.2 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:26,658 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:30:26,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -125.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:26,659 INFO L168 Benchmark]: Boogie Preprocessor took 41.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:30:26,660 INFO L168 Benchmark]: RCFGBuilder took 472.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:26,660 INFO L168 Benchmark]: TraceAbstraction took 20760.25 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -122.7 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:26,661 INFO L168 Benchmark]: Witness Printer took 78.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:30:26,662 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.24 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 374.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -125.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 472.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20760.25 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -122.7 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. * Witness Printer took 78.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 30]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 63 locations, 16 error locations. Result: SAFE, OverallTime: 20.7s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 434 SDtfs, 1592 SDslu, 736 SDs, 0 SdLazy, 4289 SolverSat, 446 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 185 SyntacticMatches, 14 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 42 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.0s 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...