./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 7862960b0aa057ac19174563f251d134d1269c2b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 03:29:19,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 03:29:19,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 03:29:19,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 03:29:19,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 03:29:19,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 03:29:19,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 03:29:19,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 03:29:19,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 03:29:19,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 03:29:19,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 03:29:19,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 03:29:19,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 03:29:19,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 03:29:19,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 03:29:19,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 03:29:19,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 03:29:19,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 03:29:19,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 03:29:19,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 03:29:19,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 03:29:19,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 03:29:19,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 03:29:19,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 03:29:19,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 03:29:19,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 03:29:19,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 03:29:19,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 03:29:19,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 03:29:19,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 03:29:19,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 03:29:19,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 03:29:19,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 03:29:19,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 03:29:19,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 03:29:19,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 03:29:19,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 03:29:19,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 03:29:19,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 03:29:19,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 03:29:19,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 03:29:19,553 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-10-26 03:29:19,606 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 03:29:19,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 03:29:19,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 03:29:19,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 03:29:19,611 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 03:29:19,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 03:29:19,611 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 03:29:19,611 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 03:29:19,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 03:29:19,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 03:29:19,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 03:29:19,613 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-26 03:29:19,614 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-26 03:29:19,614 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-26 03:29:19,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 03:29:19,614 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-26 03:29:19,615 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 03:29:19,615 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 03:29:19,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 03:29:19,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 03:29:19,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 03:29:19,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 03:29:19,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 03:29:19,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 03:29:19,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 03:29:19,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 03:29:19,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 03:29:19,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 03:29:19,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 7862960b0aa057ac19174563f251d134d1269c2b [2020-10-26 03:29:20,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 03:29:20,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 03:29:20,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 03:29:20,143 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 03:29:20,147 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 03:29:20,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2020-10-26 03:29:20,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5405f5e31/c8ed249346f4453aa23d51d447832177/FLAG93359c216 [2020-10-26 03:29:20,906 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 03:29:20,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2020-10-26 03:29:20,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5405f5e31/c8ed249346f4453aa23d51d447832177/FLAG93359c216 [2020-10-26 03:29:21,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5405f5e31/c8ed249346f4453aa23d51d447832177 [2020-10-26 03:29:21,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 03:29:21,275 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-26 03:29:21,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 03:29:21,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 03:29:21,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 03:29:21,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:29:21" (1/1) ... [2020-10-26 03:29:21,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38de77d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:29:21, skipping insertion in model container [2020-10-26 03:29:21,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:29:21" (1/1) ... [2020-10-26 03:29:21,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 03:29:21,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 03:29:21,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:29:21,552 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 03:29:21,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:29:21,602 INFO L208 MainTranslator]: Completed translation [2020-10-26 03:29:21,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:29:21 WrapperNode [2020-10-26 03:29:21,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 03:29:21,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 03:29:21,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 03:29:21,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 03:29:21,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:29:21" (1/1) ... [2020-10-26 03:29:21,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:29:21" (1/1) ... [2020-10-26 03:29:21,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:29:21" (1/1) ... [2020-10-26 03:29:21,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:29:21" (1/1) ... [2020-10-26 03:29:21,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:29:21" (1/1) ... [2020-10-26 03:29:21,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:29:21" (1/1) ... [2020-10-26 03:29:21,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:29:21" (1/1) ... [2020-10-26 03:29:21,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 03:29:21,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 03:29:21,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 03:29:21,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 03:29:21,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:29:21" (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 [2020-10-26 03:29:21,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 03:29:21,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 03:29:21,749 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 03:29:21,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-10-26 03:29:21,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-26 03:29:21,750 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-10-26 03:29:21,752 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 03:29:21,752 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-10-26 03:29:21,753 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-26 03:29:21,758 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-26 03:29:21,759 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 03:29:21,760 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 03:29:21,760 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 03:29:21,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 03:29:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-10-26 03:29:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-26 03:29:21,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-26 03:29:21,764 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-10-26 03:29:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 03:29:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 03:29:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-26 03:29:21,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-10-26 03:29:21,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 03:29:21,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 03:29:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 03:29:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 03:29:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 03:29:22,356 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 03:29:22,357 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-26 03:29:22,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:29:22 BoogieIcfgContainer [2020-10-26 03:29:22,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 03:29:22,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 03:29:22,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 03:29:22,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 03:29:22,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 03:29:21" (1/3) ... [2020-10-26 03:29:22,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2864b4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:29:22, skipping insertion in model container [2020-10-26 03:29:22,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:29:21" (2/3) ... [2020-10-26 03:29:22,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2864b4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:29:22, skipping insertion in model container [2020-10-26 03:29:22,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:29:22" (3/3) ... [2020-10-26 03:29:22,372 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2020-10-26 03:29:22,387 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 03:29:22,393 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-10-26 03:29:22,409 INFO L253 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-10-26 03:29:22,436 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 03:29:22,436 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-26 03:29:22,437 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 03:29:22,437 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 03:29:22,437 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 03:29:22,438 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 03:29:22,438 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 03:29:22,438 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 03:29:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2020-10-26 03:29:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-26 03:29:22,471 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:22,472 INFO L422 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, 1, 1] [2020-10-26 03:29:22,473 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:22,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1929799143, now seen corresponding path program 1 times [2020-10-26 03:29:22,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:22,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171343585] [2020-10-26 03:29:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:22,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:22,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:22,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:22,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171343585] [2020-10-26 03:29:22,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:29:22,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:29:22,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854075686] [2020-10-26 03:29:22,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:29:22,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:22,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:29:22,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:29:22,869 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 4 states. [2020-10-26 03:29:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:23,234 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2020-10-26 03:29:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 03:29:23,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-26 03:29:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:23,246 INFO L225 Difference]: With dead ends: 63 [2020-10-26 03:29:23,246 INFO L226 Difference]: Without dead ends: 60 [2020-10-26 03:29:23,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:29:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-10-26 03:29:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-10-26 03:29:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-26 03:29:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2020-10-26 03:29:23,303 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 25 [2020-10-26 03:29:23,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:23,303 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2020-10-26 03:29:23,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:29:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-10-26 03:29:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-26 03:29:23,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:23,305 INFO L422 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, 1, 1] [2020-10-26 03:29:23,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 03:29:23,306 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:23,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:23,307 INFO L82 PathProgramCache]: Analyzing trace with hash 341451241, now seen corresponding path program 1 times [2020-10-26 03:29:23,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:23,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189640396] [2020-10-26 03:29:23,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:23,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:23,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:23,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:23,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189640396] [2020-10-26 03:29:23,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:29:23,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-26 03:29:23,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65641095] [2020-10-26 03:29:23,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 03:29:23,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:23,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 03:29:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-26 03:29:23,672 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 8 states. [2020-10-26 03:29:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:24,926 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2020-10-26 03:29:24,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 03:29:24,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-10-26 03:29:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:24,931 INFO L225 Difference]: With dead ends: 105 [2020-10-26 03:29:24,932 INFO L226 Difference]: Without dead ends: 105 [2020-10-26 03:29:24,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-26 03:29:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-26 03:29:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2020-10-26 03:29:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-26 03:29:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2020-10-26 03:29:24,951 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 25 [2020-10-26 03:29:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:24,952 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2020-10-26 03:29:24,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 03:29:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2020-10-26 03:29:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 03:29:24,953 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:24,953 INFO L422 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, 1] [2020-10-26 03:29:24,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 03:29:24,954 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:24,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1237535227, now seen corresponding path program 1 times [2020-10-26 03:29:24,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:24,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864676675] [2020-10-26 03:29:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:25,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:25,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:25,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:25,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-10-26 03:29:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:25,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864676675] [2020-10-26 03:29:25,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:29:25,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 03:29:25,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915637730] [2020-10-26 03:29:25,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 03:29:25,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:25,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 03:29:25,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-26 03:29:25,130 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 6 states. [2020-10-26 03:29:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:25,480 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2020-10-26 03:29:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 03:29:25,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-26 03:29:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:25,484 INFO L225 Difference]: With dead ends: 82 [2020-10-26 03:29:25,485 INFO L226 Difference]: Without dead ends: 82 [2020-10-26 03:29:25,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-26 03:29:25,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-26 03:29:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-26 03:29:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-26 03:29:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2020-10-26 03:29:25,506 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 24 [2020-10-26 03:29:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:25,506 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2020-10-26 03:29:25,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 03:29:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2020-10-26 03:29:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-26 03:29:25,507 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:25,508 INFO L422 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, 1, 1] [2020-10-26 03:29:25,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 03:29:25,508 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash 291113678, now seen corresponding path program 1 times [2020-10-26 03:29:25,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:25,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351885397] [2020-10-26 03:29:25,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:25,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:25,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:25,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:25,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-10-26 03:29:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:25,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351885397] [2020-10-26 03:29:25,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:29:25,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 03:29:25,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811356055] [2020-10-26 03:29:25,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 03:29:25,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:25,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 03:29:25,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-26 03:29:25,665 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 6 states. [2020-10-26 03:29:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:26,005 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2020-10-26 03:29:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 03:29:26,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-26 03:29:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:26,008 INFO L225 Difference]: With dead ends: 81 [2020-10-26 03:29:26,008 INFO L226 Difference]: Without dead ends: 81 [2020-10-26 03:29:26,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-26 03:29:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-26 03:29:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-10-26 03:29:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-26 03:29:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2020-10-26 03:29:26,034 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 25 [2020-10-26 03:29:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:26,035 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2020-10-26 03:29:26,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 03:29:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2020-10-26 03:29:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 03:29:26,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:26,039 INFO L422 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, 1, 1, 1] [2020-10-26 03:29:26,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 03:29:26,039 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:26,041 INFO L82 PathProgramCache]: Analyzing trace with hash 434589479, now seen corresponding path program 1 times [2020-10-26 03:29:26,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:26,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594239515] [2020-10-26 03:29:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:26,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:26,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:26,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:26,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-10-26 03:29:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:26,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594239515] [2020-10-26 03:29:26,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:29:26,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 03:29:26,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162580439] [2020-10-26 03:29:26,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 03:29:26,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 03:29:26,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-26 03:29:26,149 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 6 states. [2020-10-26 03:29:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:26,488 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2020-10-26 03:29:26,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 03:29:26,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-26 03:29:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:26,490 INFO L225 Difference]: With dead ends: 80 [2020-10-26 03:29:26,490 INFO L226 Difference]: Without dead ends: 80 [2020-10-26 03:29:26,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-26 03:29:26,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-26 03:29:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-26 03:29:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-26 03:29:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2020-10-26 03:29:26,499 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 26 [2020-10-26 03:29:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:26,500 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2020-10-26 03:29:26,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 03:29:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2020-10-26 03:29:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 03:29:26,501 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:26,501 INFO L422 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, 1, 1, 1, 1] [2020-10-26 03:29:26,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 03:29:26,501 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:26,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:26,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1720277367, now seen corresponding path program 1 times [2020-10-26 03:29:26,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:26,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064695388] [2020-10-26 03:29:26,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:26,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:26,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:26,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:26,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:29:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:26,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064695388] [2020-10-26 03:29:26,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:29:26,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-26 03:29:26,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019125429] [2020-10-26 03:29:26,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 03:29:26,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:26,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 03:29:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-26 03:29:26,637 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand 8 states. [2020-10-26 03:29:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:27,058 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2020-10-26 03:29:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 03:29:27,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-10-26 03:29:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:27,060 INFO L225 Difference]: With dead ends: 76 [2020-10-26 03:29:27,061 INFO L226 Difference]: Without dead ends: 76 [2020-10-26 03:29:27,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-26 03:29:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-26 03:29:27,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-10-26 03:29:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-26 03:29:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2020-10-26 03:29:27,070 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 27 [2020-10-26 03:29:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:27,071 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2020-10-26 03:29:27,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 03:29:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2020-10-26 03:29:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 03:29:27,072 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:27,072 INFO L422 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, 1, 1, 1, 1] [2020-10-26 03:29:27,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 03:29:27,073 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:27,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:27,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1720277368, now seen corresponding path program 1 times [2020-10-26 03:29:27,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:27,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25283273] [2020-10-26 03:29:27,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:27,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:27,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:27,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:27,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:29:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:27,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25283273] [2020-10-26 03:29:27,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:29:27,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-26 03:29:27,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843809577] [2020-10-26 03:29:27,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-26 03:29:27,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:27,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 03:29:27,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-26 03:29:27,279 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 9 states. [2020-10-26 03:29:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:28,120 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2020-10-26 03:29:28,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 03:29:28,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-26 03:29:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:28,122 INFO L225 Difference]: With dead ends: 93 [2020-10-26 03:29:28,123 INFO L226 Difference]: Without dead ends: 93 [2020-10-26 03:29:28,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-10-26 03:29:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-26 03:29:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2020-10-26 03:29:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-26 03:29:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2020-10-26 03:29:28,132 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 27 [2020-10-26 03:29:28,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:28,132 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2020-10-26 03:29:28,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-26 03:29:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2020-10-26 03:29:28,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 03:29:28,133 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:28,133 INFO L422 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, 1, 1, 1, 1] [2020-10-26 03:29:28,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 03:29:28,134 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:28,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash 587372017, now seen corresponding path program 1 times [2020-10-26 03:29:28,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:28,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823886252] [2020-10-26 03:29:28,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:28,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:28,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:28,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:28,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-10-26 03:29:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:28,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823886252] [2020-10-26 03:29:28,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:29:28,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 03:29:28,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987755468] [2020-10-26 03:29:28,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 03:29:28,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:28,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 03:29:28,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-26 03:29:28,254 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 7 states. [2020-10-26 03:29:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:28,577 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2020-10-26 03:29:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 03:29:28,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-26 03:29:28,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:28,585 INFO L225 Difference]: With dead ends: 75 [2020-10-26 03:29:28,585 INFO L226 Difference]: Without dead ends: 70 [2020-10-26 03:29:28,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-26 03:29:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-26 03:29:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-26 03:29:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-26 03:29:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2020-10-26 03:29:28,592 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 27 [2020-10-26 03:29:28,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:28,592 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2020-10-26 03:29:28,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 03:29:28,593 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2020-10-26 03:29:28,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-26 03:29:28,594 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:28,594 INFO L422 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, 1, 1, 1, 1, 1] [2020-10-26 03:29:28,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 03:29:28,594 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:28,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:28,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1788990832, now seen corresponding path program 1 times [2020-10-26 03:29:28,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:28,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811034764] [2020-10-26 03:29:28,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:28,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:28,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:28,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:28,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:29:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:28,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811034764] [2020-10-26 03:29:28,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:29:28,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-26 03:29:28,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579499410] [2020-10-26 03:29:28,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-26 03:29:28,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:28,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 03:29:28,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-26 03:29:28,792 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 9 states. [2020-10-26 03:29:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:29,594 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2020-10-26 03:29:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 03:29:29,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-10-26 03:29:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:29,596 INFO L225 Difference]: With dead ends: 84 [2020-10-26 03:29:29,596 INFO L226 Difference]: Without dead ends: 84 [2020-10-26 03:29:29,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-10-26 03:29:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-26 03:29:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2020-10-26 03:29:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-26 03:29:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2020-10-26 03:29:29,614 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 28 [2020-10-26 03:29:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:29,616 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2020-10-26 03:29:29,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-26 03:29:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2020-10-26 03:29:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-26 03:29:29,619 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:29,619 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2020-10-26 03:29:29,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 03:29:29,621 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:29,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2033841114, now seen corresponding path program 1 times [2020-10-26 03:29:29,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:29,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444593145] [2020-10-26 03:29:29,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:29,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:29,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:29,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:29,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:29:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:29,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444593145] [2020-10-26 03:29:29,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115517099] [2020-10-26 03:29:29,824 INFO L95 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 [2020-10-26 03:29:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:29,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-26 03:29:29,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:29:30,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 03:29:30,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 03:29:30,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 03:29:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:30,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-26 03:29:30,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2020-10-26 03:29:30,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269429777] [2020-10-26 03:29:30,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 03:29:30,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:30,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 03:29:30,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-26 03:29:30,260 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2020-10-26 03:29:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:30,515 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2020-10-26 03:29:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 03:29:30,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-10-26 03:29:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:30,517 INFO L225 Difference]: With dead ends: 88 [2020-10-26 03:29:30,517 INFO L226 Difference]: Without dead ends: 88 [2020-10-26 03:29:30,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-10-26 03:29:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-10-26 03:29:30,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2020-10-26 03:29:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-26 03:29:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2020-10-26 03:29:30,523 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 37 [2020-10-26 03:29:30,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:30,524 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2020-10-26 03:29:30,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 03:29:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2020-10-26 03:29:30,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-26 03:29:30,525 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:30,525 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:29:30,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-26 03:29:30,738 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash 314340137, now seen corresponding path program 1 times [2020-10-26 03:29:30,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:30,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736440498] [2020-10-26 03:29:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:30,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:30,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:30,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:30,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:29:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:30,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-26 03:29:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-26 03:29:30,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736440498] [2020-10-26 03:29:30,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589078465] [2020-10-26 03:29:30,982 INFO L95 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 [2020-10-26 03:29:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:31,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 35 conjunts are in the unsatisfiable core [2020-10-26 03:29:31,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:29:31,110 INFO L384 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 [2020-10-26 03:29:31,110 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:29:31,118 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:29:31,119 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:29:31,119 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2020-10-26 03:29:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-26 03:29:32,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:29:32,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2020-10-26 03:29:32,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385960713] [2020-10-26 03:29:32,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-26 03:29:32,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:32,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-26 03:29:32,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=366, Unknown=1, NotChecked=0, Total=420 [2020-10-26 03:29:32,456 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 21 states. [2020-10-26 03:29:34,510 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2020-10-26 03:29:34,723 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-26 03:29:35,074 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2020-10-26 03:29:35,236 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-10-26 03:29:35,401 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2020-10-26 03:29:35,610 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2020-10-26 03:29:35,833 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-10-26 03:29:36,069 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2020-10-26 03:29:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:37,009 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2020-10-26 03:29:37,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-26 03:29:37,010 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2020-10-26 03:29:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:37,013 INFO L225 Difference]: With dead ends: 106 [2020-10-26 03:29:37,013 INFO L226 Difference]: Without dead ends: 104 [2020-10-26 03:29:37,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=245, Invalid=1083, Unknown=4, NotChecked=0, Total=1332 [2020-10-26 03:29:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-26 03:29:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2020-10-26 03:29:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-26 03:29:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2020-10-26 03:29:37,032 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 39 [2020-10-26 03:29:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:37,033 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2020-10-26 03:29:37,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-26 03:29:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2020-10-26 03:29:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-26 03:29:37,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:37,039 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:29:37,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:29:37,253 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:37,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:37,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1154609631, now seen corresponding path program 1 times [2020-10-26 03:29:37,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:37,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809600436] [2020-10-26 03:29:37,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:37,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:37,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:37,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:37,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:29:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:37,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-26 03:29:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-26 03:29:37,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809600436] [2020-10-26 03:29:37,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523104815] [2020-10-26 03:29:37,533 INFO L95 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 [2020-10-26 03:29:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:37,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 34 conjunts are in the unsatisfiable core [2020-10-26 03:29:37,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:29:37,664 INFO L384 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 [2020-10-26 03:29:37,665 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:29:37,677 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:29:37,677 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:29:37,677 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2020-10-26 03:29:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:38,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:29:38,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2020-10-26 03:29:38,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001591661] [2020-10-26 03:29:38,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-26 03:29:38,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:38,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-26 03:29:38,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2020-10-26 03:29:38,351 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 21 states. [2020-10-26 03:29:39,383 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2020-10-26 03:29:39,657 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2020-10-26 03:29:41,219 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2020-10-26 03:29:41,578 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2020-10-26 03:29:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:41,757 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2020-10-26 03:29:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-26 03:29:41,758 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2020-10-26 03:29:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:41,760 INFO L225 Difference]: With dead ends: 140 [2020-10-26 03:29:41,760 INFO L226 Difference]: Without dead ends: 140 [2020-10-26 03:29:41,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=257, Invalid=1129, Unknown=20, NotChecked=0, Total=1406 [2020-10-26 03:29:41,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-26 03:29:41,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2020-10-26 03:29:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-26 03:29:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2020-10-26 03:29:41,774 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 40 [2020-10-26 03:29:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:41,775 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2020-10-26 03:29:41,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-26 03:29:41,775 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2020-10-26 03:29:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-26 03:29:41,782 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:41,782 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2020-10-26 03:29:41,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-10-26 03:29:41,996 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash -411974559, now seen corresponding path program 1 times [2020-10-26 03:29:41,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:41,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190387094] [2020-10-26 03:29:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:42,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:42,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:42,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:42,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:29:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:42,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-26 03:29:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:42,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-26 03:29:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 03:29:42,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190387094] [2020-10-26 03:29:42,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668003875] [2020-10-26 03:29:42,291 INFO L95 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 [2020-10-26 03:29:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:42,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-26 03:29:42,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:29:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 03:29:42,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:29:42,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2020-10-26 03:29:42,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264307374] [2020-10-26 03:29:42,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-26 03:29:42,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:42,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-26 03:29:42,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2020-10-26 03:29:42,829 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand 20 states. [2020-10-26 03:29:44,467 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-10-26 03:29:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:45,364 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2020-10-26 03:29:45,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-26 03:29:45,365 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2020-10-26 03:29:45,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:45,367 INFO L225 Difference]: With dead ends: 133 [2020-10-26 03:29:45,367 INFO L226 Difference]: Without dead ends: 133 [2020-10-26 03:29:45,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=284, Invalid=1276, Unknown=0, NotChecked=0, Total=1560 [2020-10-26 03:29:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-26 03:29:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2020-10-26 03:29:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-26 03:29:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2020-10-26 03:29:45,377 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 41 [2020-10-26 03:29:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:45,377 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2020-10-26 03:29:45,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-26 03:29:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2020-10-26 03:29:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-26 03:29:45,379 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:45,379 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2020-10-26 03:29:45,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:29:45,593 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:45,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash -770560254, now seen corresponding path program 1 times [2020-10-26 03:29:45,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:45,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882485913] [2020-10-26 03:29:45,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:45,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:45,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:45,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:45,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:29:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:45,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-26 03:29:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:45,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-26 03:29:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-26 03:29:45,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882485913] [2020-10-26 03:29:45,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12061088] [2020-10-26 03:29:45,888 INFO L95 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 [2020-10-26 03:29:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:45,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-26 03:29:45,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:29:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:46,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:29:46,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2020-10-26 03:29:46,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111678320] [2020-10-26 03:29:46,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-26 03:29:46,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:46,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-26 03:29:46,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2020-10-26 03:29:46,673 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 27 states. [2020-10-26 03:29:47,623 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-10-26 03:29:47,795 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-10-26 03:29:47,951 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-10-26 03:29:48,116 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-10-26 03:29:48,617 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-10-26 03:29:48,787 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-10-26 03:29:48,945 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-10-26 03:29:49,116 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-10-26 03:29:49,281 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-10-26 03:29:49,498 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2020-10-26 03:29:49,717 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2020-10-26 03:29:50,060 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-10-26 03:29:50,270 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-10-26 03:29:50,548 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2020-10-26 03:29:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:51,644 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2020-10-26 03:29:51,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-10-26 03:29:51,645 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2020-10-26 03:29:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:51,647 INFO L225 Difference]: With dead ends: 158 [2020-10-26 03:29:51,647 INFO L226 Difference]: Without dead ends: 158 [2020-10-26 03:29:51,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=491, Invalid=2479, Unknown=0, NotChecked=0, Total=2970 [2020-10-26 03:29:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-26 03:29:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 114. [2020-10-26 03:29:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-26 03:29:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2020-10-26 03:29:51,658 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 43 [2020-10-26 03:29:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:51,659 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2020-10-26 03:29:51,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-26 03:29:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2020-10-26 03:29:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-26 03:29:51,660 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:51,660 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2020-10-26 03:29:51,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-10-26 03:29:51,875 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2050423932, now seen corresponding path program 1 times [2020-10-26 03:29:51,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:51,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393159099] [2020-10-26 03:29:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:52,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:52,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:52,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:52,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:29:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:52,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-26 03:29:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:52,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-26 03:29:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-26 03:29:52,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393159099] [2020-10-26 03:29:52,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351139060] [2020-10-26 03:29:52,134 INFO L95 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 [2020-10-26 03:29:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:52,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-26 03:29:52,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:29:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:29:52,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:29:52,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2020-10-26 03:29:52,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206590902] [2020-10-26 03:29:52,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-26 03:29:52,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:29:52,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-26 03:29:52,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2020-10-26 03:29:52,783 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 24 states. [2020-10-26 03:29:53,782 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2020-10-26 03:29:55,203 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-10-26 03:29:55,457 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2020-10-26 03:29:55,655 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2020-10-26 03:29:55,940 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-10-26 03:29:56,140 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-10-26 03:29:56,663 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-10-26 03:29:56,868 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-10-26 03:29:57,115 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2020-10-26 03:29:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:29:57,566 INFO L93 Difference]: Finished difference Result 172 states and 201 transitions. [2020-10-26 03:29:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-26 03:29:57,567 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2020-10-26 03:29:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:29:57,570 INFO L225 Difference]: With dead ends: 172 [2020-10-26 03:29:57,570 INFO L226 Difference]: Without dead ends: 172 [2020-10-26 03:29:57,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=546, Invalid=2210, Unknown=0, NotChecked=0, Total=2756 [2020-10-26 03:29:57,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-26 03:29:57,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 129. [2020-10-26 03:29:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-10-26 03:29:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2020-10-26 03:29:57,591 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 43 [2020-10-26 03:29:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:29:57,592 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2020-10-26 03:29:57,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-26 03:29:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2020-10-26 03:29:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-26 03:29:57,593 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:29:57,593 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2020-10-26 03:29:57,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:29:57,808 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:29:57,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:29:57,809 INFO L82 PathProgramCache]: Analyzing trace with hash 608414758, now seen corresponding path program 1 times [2020-10-26 03:29:57,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:29:57,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857858601] [2020-10-26 03:29:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:29:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:58,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:29:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:58,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:29:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:58,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:29:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:58,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:29:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:58,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-26 03:29:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:58,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-26 03:29:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-26 03:29:58,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857858601] [2020-10-26 03:29:58,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943660842] [2020-10-26 03:29:58,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:29:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:29:58,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-26 03:29:58,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:29:58,196 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2020-10-26 03:29:58,196 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:29:58,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:29:58,200 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:29:58,200 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2020-10-26 03:30:00,227 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_13 Int)) (= (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_13) ((as const (Array Int Int)) 0))) is different from true [2020-10-26 03:30:02,246 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_14 Int)) (= (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_14) ((as const (Array Int Int)) 0))) is different from true [2020-10-26 03:30:04,271 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_15 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_15))) is different from true [2020-10-26 03:30:04,378 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2020-10-26 03:30:04,379 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:30:04,385 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:30:04,388 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-26 03:30:04,388 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2020-10-26 03:30:04,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 03:30:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2020-10-26 03:30:04,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:30:04,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2020-10-26 03:30:04,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593829846] [2020-10-26 03:30:04,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-26 03:30:04,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:04,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-26 03:30:04,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=374, Unknown=3, NotChecked=120, Total=552 [2020-10-26 03:30:04,534 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 24 states. [2020-10-26 03:30:09,071 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 40 [2020-10-26 03:30:11,152 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 43 [2020-10-26 03:30:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:19,950 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2020-10-26 03:30:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-26 03:30:19,954 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2020-10-26 03:30:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:19,956 INFO L225 Difference]: With dead ends: 132 [2020-10-26 03:30:19,956 INFO L226 Difference]: Without dead ends: 120 [2020-10-26 03:30:19,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=166, Invalid=961, Unknown=7, NotChecked=198, Total=1332 [2020-10-26 03:30:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-26 03:30:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2020-10-26 03:30:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-10-26 03:30:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2020-10-26 03:30:19,969 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 49 [2020-10-26 03:30:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:19,970 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2020-10-26 03:30:19,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-26 03:30:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2020-10-26 03:30:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-26 03:30:19,971 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:19,971 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:30:20,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-10-26 03:30:20,186 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:30:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash 879330896, now seen corresponding path program 1 times [2020-10-26 03:30:20,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:20,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718352168] [2020-10-26 03:30:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:30:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:30:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:30:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-26 03:30:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-26 03:30:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-26 03:30:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-10-26 03:30:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-26 03:30:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-26 03:30:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-26 03:30:20,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718352168] [2020-10-26 03:30:20,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148240369] [2020-10-26 03:30:20,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:30:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:20,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 32 conjunts are in the unsatisfiable core [2020-10-26 03:30:20,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:30:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-26 03:30:21,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:30:21,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 28 [2020-10-26 03:30:21,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543100455] [2020-10-26 03:30:21,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-26 03:30:21,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:21,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-26 03:30:21,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2020-10-26 03:30:21,312 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 28 states. [2020-10-26 03:30:22,120 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-10-26 03:30:22,289 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-26 03:30:22,587 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-26 03:30:22,786 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-10-26 03:30:22,987 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-10-26 03:30:23,181 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-10-26 03:30:23,417 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-10-26 03:30:24,589 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-10-26 03:30:28,221 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2020-10-26 03:30:29,527 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2020-10-26 03:30:29,773 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2020-10-26 03:30:30,268 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2020-10-26 03:30:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:30,305 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2020-10-26 03:30:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-26 03:30:30,306 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2020-10-26 03:30:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:30,307 INFO L225 Difference]: With dead ends: 113 [2020-10-26 03:30:30,308 INFO L226 Difference]: Without dead ends: 88 [2020-10-26 03:30:30,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=298, Invalid=1958, Unknown=0, NotChecked=0, Total=2256 [2020-10-26 03:30:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-10-26 03:30:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2020-10-26 03:30:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-26 03:30:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2020-10-26 03:30:30,313 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 73 [2020-10-26 03:30:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:30,313 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2020-10-26 03:30:30,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-26 03:30:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2020-10-26 03:30:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-26 03:30:30,315 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:30,315 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:30:30,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-26 03:30:30,527 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-26 03:30:30,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:30,528 INFO L82 PathProgramCache]: Analyzing trace with hash -14155442, now seen corresponding path program 1 times [2020-10-26 03:30:30,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:30,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925728700] [2020-10-26 03:30:30,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:30,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:30,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:30:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:30,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-26 03:30:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:30,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-26 03:30:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:30,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-26 03:30:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:30,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-26 03:30:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:30,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-26 03:30:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:30,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-10-26 03:30:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:30,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-26 03:30:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:31,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-26 03:30:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-26 03:30:31,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925728700] [2020-10-26 03:30:31,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346294320] [2020-10-26 03:30:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:30:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:31,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 32 conjunts are in the unsatisfiable core [2020-10-26 03:30:31,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:30:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-26 03:30:31,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:30:31,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2020-10-26 03:30:31,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191361189] [2020-10-26 03:30:31,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-10-26 03:30:31,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:31,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-10-26 03:30:31,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2020-10-26 03:30:31,878 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 33 states. [2020-10-26 03:30:32,981 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2020-10-26 03:30:33,154 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2020-10-26 03:30:33,523 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2020-10-26 03:30:33,708 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2020-10-26 03:30:33,887 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-10-26 03:30:34,060 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-10-26 03:30:34,288 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-10-26 03:30:34,492 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-10-26 03:30:34,854 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2020-10-26 03:30:35,087 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-10-26 03:30:35,291 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-10-26 03:30:35,592 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2020-10-26 03:30:35,825 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2020-10-26 03:30:36,232 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2020-10-26 03:30:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:36,278 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2020-10-26 03:30:36,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-26 03:30:36,280 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 73 [2020-10-26 03:30:36,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:36,280 INFO L225 Difference]: With dead ends: 87 [2020-10-26 03:30:36,280 INFO L226 Difference]: Without dead ends: 0 [2020-10-26 03:30:36,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=440, Invalid=2750, Unknown=2, NotChecked=0, Total=3192 [2020-10-26 03:30:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-26 03:30:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-26 03:30:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-26 03:30:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 03:30:36,283 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2020-10-26 03:30:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:36,283 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 03:30:36,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-10-26 03:30:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-26 03:30:36,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-26 03:30:36,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-26 03:30:36,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 03:30:36 BoogieIcfgContainer [2020-10-26 03:30:36,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 03:30:36,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 03:30:36,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 03:30:36,493 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 03:30:36,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:29:22" (3/4) ... [2020-10-26 03:30:36,497 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-26 03:30:36,503 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2020-10-26 03:30:36,503 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-10-26 03:30:36,503 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2020-10-26 03:30:36,503 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-10-26 03:30:36,503 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2020-10-26 03:30:36,503 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2020-10-26 03:30:36,504 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2020-10-26 03:30:36,509 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2020-10-26 03:30:36,510 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-10-26 03:30:36,510 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-26 03:30:36,510 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-26 03:30:36,584 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 03:30:36,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 03:30:36,585 INFO L168 Benchmark]: Toolchain (without parser) took 75315.31 ms. Allocated memory was 52.4 MB in the beginning and 111.1 MB in the end (delta: 58.7 MB). Free memory was 38.5 MB in the beginning and 65.4 MB in the end (delta: -26.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 16.1 GB. [2020-10-26 03:30:36,586 INFO L168 Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 39.8 MB. Free memory was 24.6 MB in the beginning and 24.5 MB in the end (delta: 28.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 03:30:36,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.35 ms. Allocated memory is still 52.4 MB. Free memory was 37.9 MB in the beginning and 30.5 MB in the end (delta: 7.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-26 03:30:36,587 INFO L168 Benchmark]: Boogie Preprocessor took 49.21 ms. Allocated memory is still 52.4 MB. Free memory was 30.5 MB in the beginning and 28.9 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 03:30:36,587 INFO L168 Benchmark]: RCFGBuilder took 704.37 ms. Allocated memory is still 52.4 MB. Free memory was 28.9 MB in the beginning and 36.1 MB in the end (delta: -7.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. [2020-10-26 03:30:36,588 INFO L168 Benchmark]: TraceAbstraction took 74130.71 ms. Allocated memory was 52.4 MB in the beginning and 111.1 MB in the end (delta: 58.7 MB). Free memory was 35.6 MB in the beginning and 68.4 MB in the end (delta: -32.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.1 GB. [2020-10-26 03:30:36,588 INFO L168 Benchmark]: Witness Printer took 92.15 ms. Allocated memory is still 111.1 MB. Free memory was 68.4 MB in the beginning and 65.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 03:30:36,592 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.64 ms. Allocated memory is still 39.8 MB. Free memory was 24.6 MB in the beginning and 24.5 MB in the end (delta: 28.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 327.35 ms. Allocated memory is still 52.4 MB. Free memory was 37.9 MB in the beginning and 30.5 MB in the end (delta: 7.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.21 ms. Allocated memory is still 52.4 MB. Free memory was 30.5 MB in the beginning and 28.9 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 704.37 ms. Allocated memory is still 52.4 MB. Free memory was 28.9 MB in the beginning and 36.1 MB in the end (delta: -7.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 74130.71 ms. Allocated memory was 52.4 MB in the beginning and 111.1 MB in the end (delta: 58.7 MB). Free memory was 35.6 MB in the beginning and 68.4 MB in the end (delta: -32.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.1 GB. * Witness Printer took 92.15 ms. Allocated memory is still 111.1 MB. Free memory was 68.4 MB in the beginning and 65.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 66 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 74.0s, OverallIterations: 18, TraceHistogramMax: 3, AutomataDifference: 54.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 735 SDtfs, 3059 SDslu, 1450 SDs, 0 SdLazy, 9582 SolverSat, 1936 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 986 GetRequests, 516 SyntacticMatches, 22 SemanticMatches, 448 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2508 ImplicationChecksByTransitivity, 48.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 274 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 1110 NumberOfCodeBlocks, 1110 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1083 ConstructedInterpolants, 62 QuantifiedInterpolants, 284585 SizeOfPredicates, 76 NumberOfNonLiveVariables, 2158 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 168/272 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...