./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -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 a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:57:02,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:57:02,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:57:02,731 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:57:02,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:57:02,734 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:57:02,735 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:57:02,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:57:02,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:57:02,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:57:02,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:57:02,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:57:02,747 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:57:02,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:57:02,749 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:57:02,750 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:57:02,751 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:57:02,754 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:57:02,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:57:02,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:57:02,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:57:02,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:57:02,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:57:02,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:57:02,770 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:57:02,771 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:57:02,774 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:57:02,775 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:57:02,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:57:02,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:57:02,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:57:02,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:57:02,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:57:02,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:57:02,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:57:02,779 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:57:02,780 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:57:02,796 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:57:02,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:57:02,798 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:57:02,798 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:57:02,798 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:57:02,799 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:57:02,799 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:57:02,799 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:57:02,799 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:57:02,799 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:57:02,799 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:57:02,800 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:57:02,800 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:57:02,800 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:57:02,800 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:57:02,800 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:57:02,801 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:57:02,801 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:57:02,801 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:57:02,801 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:57:02,801 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:57:02,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:57:02,802 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:57:02,802 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:57:02,802 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:57:02,802 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:57:02,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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 -> a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 [2019-01-13 21:57:02,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:57:02,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:57:02,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:57:02,879 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:57:02,880 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:57:02,880 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:57:02,939 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96567688c/27196f39b0b148f0858c2f8ee588f4b0/FLAGca520a81d [2019-01-13 21:57:03,464 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:57:03,466 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:57:03,482 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96567688c/27196f39b0b148f0858c2f8ee588f4b0/FLAGca520a81d [2019-01-13 21:57:03,744 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96567688c/27196f39b0b148f0858c2f8ee588f4b0 [2019-01-13 21:57:03,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:57:03,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:57:03,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:57:03,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:57:03,753 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:57:03,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:57:03" (1/1) ... [2019-01-13 21:57:03,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be4eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:03, skipping insertion in model container [2019-01-13 21:57:03,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:57:03" (1/1) ... [2019-01-13 21:57:03,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:57:03,811 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:57:04,156 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:57:04,172 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:57:04,303 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:57:04,365 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:57:04,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:04 WrapperNode [2019-01-13 21:57:04,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:57:04,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:57:04,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:57:04,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:57:04,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:04" (1/1) ... [2019-01-13 21:57:04,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:04" (1/1) ... [2019-01-13 21:57:04,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:04" (1/1) ... [2019-01-13 21:57:04,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:04" (1/1) ... [2019-01-13 21:57:04,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:04" (1/1) ... [2019-01-13 21:57:04,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:04" (1/1) ... [2019-01-13 21:57:04,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:04" (1/1) ... [2019-01-13 21:57:04,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:57:04,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:57:04,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:57:04,437 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:57:04,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:57:04,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:57:04,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:57:04,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:57:04,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:57:04,490 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlen [2019-01-13 21:57:04,490 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2019-01-13 21:57:04,490 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrstr [2019-01-13 21:57:04,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:57:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:57:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:57:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:57:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:57:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:57:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:57:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:57:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:57:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:57:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:57:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:57:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:57:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:57:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:57:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:57:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:57:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:57:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:57:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:57:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:57:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:57:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:57:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:57:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:57:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:57:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:57:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:57:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:57:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:57:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:57:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:57:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:57:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:57:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:57:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:57:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:57:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:57:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:57:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:57:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:57:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:57:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:57:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:57:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:57:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:57:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:57:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:57:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:57:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:57:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:57:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:57:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:57:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:57:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:57:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:57:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:57:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:57:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:57:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:57:04,502 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:57:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:57:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:57:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:57:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:57:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:57:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:57:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:57:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:57:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:57:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:57:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:57:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:57:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:57:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:57:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:57:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:57:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:57:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:57:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:57:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:57:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:57:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:57:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:57:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:57:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:57:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:57:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:57:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:57:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:57:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:57:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:57:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:57:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:57:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:57:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:57:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:57:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:57:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:57:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:57:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:57:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:57:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:57:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:57:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlen [2019-01-13 21:57:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:57:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2019-01-13 21:57:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure cstrstr [2019-01-13 21:57:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:57:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:57:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:57:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:57:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:57:04,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:57:05,298 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:57:05,298 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-13 21:57:05,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:05 BoogieIcfgContainer [2019-01-13 21:57:05,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:57:05,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:57:05,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:57:05,308 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:57:05,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:57:03" (1/3) ... [2019-01-13 21:57:05,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f013e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:57:05, skipping insertion in model container [2019-01-13 21:57:05,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:04" (2/3) ... [2019-01-13 21:57:05,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f013e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:57:05, skipping insertion in model container [2019-01-13 21:57:05,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:05" (3/3) ... [2019-01-13 21:57:05,312 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:57:05,320 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:57:05,327 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-01-13 21:57:05,342 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-01-13 21:57:05,364 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:57:05,365 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:57:05,365 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:57:05,365 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:57:05,366 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:57:05,366 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:57:05,366 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:57:05,366 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:57:05,366 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:57:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2019-01-13 21:57:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:57:05,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:05,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:05,395 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:05,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:05,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1747572420, now seen corresponding path program 1 times [2019-01-13 21:57:05,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:05,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:05,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:05,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:05,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:05,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:05,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:57:05,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:57:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:57:05,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:05,622 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2019-01-13 21:57:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:06,011 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-01-13 21:57:06,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:57:06,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:57:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:06,023 INFO L225 Difference]: With dead ends: 80 [2019-01-13 21:57:06,023 INFO L226 Difference]: Without dead ends: 77 [2019-01-13 21:57:06,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-13 21:57:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-13 21:57:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-13 21:57:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-01-13 21:57:06,071 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 10 [2019-01-13 21:57:06,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:06,071 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-01-13 21:57:06,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:57:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-01-13 21:57:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:57:06,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:06,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:06,073 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:06,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:06,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1747572421, now seen corresponding path program 1 times [2019-01-13 21:57:06,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:06,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:06,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:06,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:06,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:06,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:06,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:06,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:06,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:06,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:06,225 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2019-01-13 21:57:06,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:06,309 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-01-13 21:57:06,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:06,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:57:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:06,312 INFO L225 Difference]: With dead ends: 76 [2019-01-13 21:57:06,314 INFO L226 Difference]: Without dead ends: 76 [2019-01-13 21:57:06,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-13 21:57:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-13 21:57:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-13 21:57:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-01-13 21:57:06,333 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2019-01-13 21:57:06,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:06,334 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-01-13 21:57:06,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-01-13 21:57:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:57:06,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:06,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:06,335 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1659829787, now seen corresponding path program 1 times [2019-01-13 21:57:06,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:06,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:06,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:06,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:06,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:06,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:06,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:57:06,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:57:06,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:57:06,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:06,397 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 3 states. [2019-01-13 21:57:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:06,461 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2019-01-13 21:57:06,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:57:06,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 21:57:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:06,463 INFO L225 Difference]: With dead ends: 75 [2019-01-13 21:57:06,464 INFO L226 Difference]: Without dead ends: 75 [2019-01-13 21:57:06,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-13 21:57:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-13 21:57:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-13 21:57:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-01-13 21:57:06,473 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 11 [2019-01-13 21:57:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:06,474 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-01-13 21:57:06,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:57:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-01-13 21:57:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:57:06,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:06,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:06,476 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:06,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:06,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1659829786, now seen corresponding path program 1 times [2019-01-13 21:57:06,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:06,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:06,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:06,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:06,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:06,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:06,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:06,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:06,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:06,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:06,585 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 4 states. [2019-01-13 21:57:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:06,627 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-01-13 21:57:06,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:06,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:57:06,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:06,629 INFO L225 Difference]: With dead ends: 74 [2019-01-13 21:57:06,630 INFO L226 Difference]: Without dead ends: 74 [2019-01-13 21:57:06,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-13 21:57:06,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-13 21:57:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-13 21:57:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-01-13 21:57:06,653 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 11 [2019-01-13 21:57:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:06,654 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-01-13 21:57:06,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-01-13 21:57:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:57:06,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:06,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:06,655 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:06,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:06,660 INFO L82 PathProgramCache]: Analyzing trace with hash -30588361, now seen corresponding path program 1 times [2019-01-13 21:57:06,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:06,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:06,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:06,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:06,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:06,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:06,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:57:06,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:57:06,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:57:06,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:57:06,918 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 5 states. [2019-01-13 21:57:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:07,148 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-01-13 21:57:07,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:57:07,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-13 21:57:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:07,151 INFO L225 Difference]: With dead ends: 73 [2019-01-13 21:57:07,152 INFO L226 Difference]: Without dead ends: 73 [2019-01-13 21:57:07,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:57:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-13 21:57:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-13 21:57:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 21:57:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-01-13 21:57:07,160 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 14 [2019-01-13 21:57:07,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:07,160 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-01-13 21:57:07,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:57:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-01-13 21:57:07,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:57:07,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:07,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:07,162 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:07,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:07,162 INFO L82 PathProgramCache]: Analyzing trace with hash -30588360, now seen corresponding path program 1 times [2019-01-13 21:57:07,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:07,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:07,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:07,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:07,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:07,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:07,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:07,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:57:07,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:57:07,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:57:07,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:57:07,314 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 7 states. [2019-01-13 21:57:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:07,531 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-01-13 21:57:07,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:57:07,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-13 21:57:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:07,534 INFO L225 Difference]: With dead ends: 72 [2019-01-13 21:57:07,534 INFO L226 Difference]: Without dead ends: 72 [2019-01-13 21:57:07,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-13 21:57:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-13 21:57:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-13 21:57:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-01-13 21:57:07,543 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 14 [2019-01-13 21:57:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:07,546 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-01-13 21:57:07,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:57:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-01-13 21:57:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 21:57:07,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:07,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:07,547 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:07,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:07,550 INFO L82 PathProgramCache]: Analyzing trace with hash -766735103, now seen corresponding path program 1 times [2019-01-13 21:57:07,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:07,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:07,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:07,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:07,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:57:07,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:57:07,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:57:07,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:57:07,659 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 7 states. [2019-01-13 21:57:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:07,909 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2019-01-13 21:57:07,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:57:07,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-13 21:57:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:07,912 INFO L225 Difference]: With dead ends: 71 [2019-01-13 21:57:07,912 INFO L226 Difference]: Without dead ends: 71 [2019-01-13 21:57:07,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:57:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-13 21:57:07,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-13 21:57:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-13 21:57:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2019-01-13 21:57:07,919 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 19 [2019-01-13 21:57:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:07,919 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2019-01-13 21:57:07,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:57:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2019-01-13 21:57:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 21:57:07,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:07,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:07,920 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:07,921 INFO L82 PathProgramCache]: Analyzing trace with hash -766735102, now seen corresponding path program 1 times [2019-01-13 21:57:07,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:07,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:07,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:08,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:08,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 21:57:08,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 21:57:08,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 21:57:08,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:57:08,373 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 12 states. [2019-01-13 21:57:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:09,071 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-01-13 21:57:09,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 21:57:09,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-01-13 21:57:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:09,076 INFO L225 Difference]: With dead ends: 80 [2019-01-13 21:57:09,076 INFO L226 Difference]: Without dead ends: 80 [2019-01-13 21:57:09,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-01-13 21:57:09,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-13 21:57:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2019-01-13 21:57:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-13 21:57:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-01-13 21:57:09,084 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 19 [2019-01-13 21:57:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:09,084 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-01-13 21:57:09,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 21:57:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-01-13 21:57:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 21:57:09,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:09,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:09,087 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:09,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1368651781, now seen corresponding path program 1 times [2019-01-13 21:57:09,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:09,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:09,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:09,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:09,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:09,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:09,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:09,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:09,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:09,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:09,163 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2019-01-13 21:57:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:09,377 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2019-01-13 21:57:09,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:09,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-01-13 21:57:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:09,379 INFO L225 Difference]: With dead ends: 71 [2019-01-13 21:57:09,379 INFO L226 Difference]: Without dead ends: 65 [2019-01-13 21:57:09,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-13 21:57:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-13 21:57:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-13 21:57:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-01-13 21:57:09,385 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 21 [2019-01-13 21:57:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:09,385 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-01-13 21:57:09,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-01-13 21:57:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 21:57:09,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:09,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:09,389 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:09,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1169314702, now seen corresponding path program 1 times [2019-01-13 21:57:09,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:09,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:09,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:09,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:09,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:09,609 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-01-13 21:57:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:10,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:10,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:10,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:10,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:10,111 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:10,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:10,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:10,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:10,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:10,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-13 21:57:10,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2019-01-13 21:57:10,255 INFO L478 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 12 treesize of output 11 [2019-01-13 21:57:10,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:10,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:10,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:10,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-13 21:57:10,653 INFO L478 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 19 treesize of output 15 [2019-01-13 21:57:10,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:57:10,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:10,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:10,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:10,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2019-01-13 21:57:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:10,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:10,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-01-13 21:57:10,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-13 21:57:10,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-13 21:57:10,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2019-01-13 21:57:10,997 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 24 states. [2019-01-13 21:57:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:12,180 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-01-13 21:57:12,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 21:57:12,182 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2019-01-13 21:57:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:12,184 INFO L225 Difference]: With dead ends: 74 [2019-01-13 21:57:12,185 INFO L226 Difference]: Without dead ends: 74 [2019-01-13 21:57:12,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=186, Invalid=1146, Unknown=0, NotChecked=0, Total=1332 [2019-01-13 21:57:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-13 21:57:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2019-01-13 21:57:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-13 21:57:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-01-13 21:57:12,192 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 22 [2019-01-13 21:57:12,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:12,192 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-01-13 21:57:12,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-13 21:57:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-01-13 21:57:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 21:57:12,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:12,193 INFO L402 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] [2019-01-13 21:57:12,193 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash 310248900, now seen corresponding path program 1 times [2019-01-13 21:57:12,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:12,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:12,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:12,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:12,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:12,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:12,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:57:12,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:57:12,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:57:12,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:57:12,369 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 6 states. [2019-01-13 21:57:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:12,474 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-01-13 21:57:12,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:57:12,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-01-13 21:57:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:12,483 INFO L225 Difference]: With dead ends: 62 [2019-01-13 21:57:12,483 INFO L226 Difference]: Without dead ends: 62 [2019-01-13 21:57:12,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-13 21:57:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-13 21:57:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-13 21:57:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-01-13 21:57:12,487 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 27 [2019-01-13 21:57:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:12,488 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-01-13 21:57:12,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:57:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-01-13 21:57:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 21:57:12,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:12,490 INFO L402 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] [2019-01-13 21:57:12,491 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:12,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:12,491 INFO L82 PathProgramCache]: Analyzing trace with hash 310248901, now seen corresponding path program 1 times [2019-01-13 21:57:12,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:12,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:12,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:12,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:12,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:12,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:12,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:57:12,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:57:12,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:57:12,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:12,734 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 8 states. [2019-01-13 21:57:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:12,937 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-01-13 21:57:12,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:57:12,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-13 21:57:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:12,940 INFO L225 Difference]: With dead ends: 67 [2019-01-13 21:57:12,940 INFO L226 Difference]: Without dead ends: 67 [2019-01-13 21:57:12,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:57:12,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-13 21:57:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-01-13 21:57:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-13 21:57:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-01-13 21:57:12,947 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 27 [2019-01-13 21:57:12,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:12,947 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-01-13 21:57:12,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:57:12,947 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-01-13 21:57:12,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 21:57:12,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:12,948 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:12,948 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:12,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1568641732, now seen corresponding path program 1 times [2019-01-13 21:57:12,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:12,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:12,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:13,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:13,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 21:57:13,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:57:13,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:57:13,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:57:13,302 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 10 states. [2019-01-13 21:57:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:13,546 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2019-01-13 21:57:13,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 21:57:13,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-13 21:57:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:13,549 INFO L225 Difference]: With dead ends: 81 [2019-01-13 21:57:13,549 INFO L226 Difference]: Without dead ends: 65 [2019-01-13 21:57:13,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-01-13 21:57:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-13 21:57:13,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-13 21:57:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-13 21:57:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-01-13 21:57:13,555 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 32 [2019-01-13 21:57:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:13,555 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-01-13 21:57:13,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:57:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-01-13 21:57:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 21:57:13,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:13,559 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:13,559 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:13,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1506602118, now seen corresponding path program 1 times [2019-01-13 21:57:13,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:13,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:13,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:13,947 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2019-01-13 21:57:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:14,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:14,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:14,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:14,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:14,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:57:14,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:14,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:14,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:57:14,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:57:14,275 INFO L478 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 11 treesize of output 10 [2019-01-13 21:57:14,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:14,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:14,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:14,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-13 21:57:14,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-13 21:57:14,411 INFO L478 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 11 treesize of output 10 [2019-01-13 21:57:14,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:14,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:14,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:14,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-13 21:57:21,623 WARN L181 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-01-13 21:57:21,802 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-13 21:57:21,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 52 [2019-01-13 21:57:21,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2019-01-13 21:57:21,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:22,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 39 [2019-01-13 21:57:22,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:22,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2019-01-13 21:57:22,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:22,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 26 [2019-01-13 21:57:22,481 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:22,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 31 treesize of output 23 [2019-01-13 21:57:22,540 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:22,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 36 treesize of output 28 [2019-01-13 21:57:22,605 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:22,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 18 [2019-01-13 21:57:22,735 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:22,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 31 [2019-01-13 21:57:22,823 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:22,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-13 21:57:22,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:22,915 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:72, output treesize:29 [2019-01-13 21:57:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:23,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:23,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 21 [2019-01-13 21:57:23,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 21:57:23,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 21:57:23,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=405, Unknown=3, NotChecked=0, Total=462 [2019-01-13 21:57:23,028 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 22 states. [2019-01-13 21:57:25,480 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-13 21:57:26,123 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2019-01-13 21:57:26,740 WARN L181 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-01-13 21:57:28,812 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-13 21:57:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:31,164 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2019-01-13 21:57:31,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 21:57:31,165 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-01-13 21:57:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:31,167 INFO L225 Difference]: With dead ends: 103 [2019-01-13 21:57:31,167 INFO L226 Difference]: Without dead ends: 103 [2019-01-13 21:57:31,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=136, Invalid=791, Unknown=3, NotChecked=0, Total=930 [2019-01-13 21:57:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-13 21:57:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2019-01-13 21:57:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-13 21:57:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2019-01-13 21:57:31,173 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 32 [2019-01-13 21:57:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:31,174 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2019-01-13 21:57:31,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 21:57:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2019-01-13 21:57:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 21:57:31,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:31,183 INFO L402 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, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:31,183 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:31,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash -438463226, now seen corresponding path program 1 times [2019-01-13 21:57:31,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:31,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:31,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:31,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:31,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:31,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:57:31,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:57:31,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:57:31,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:57:31,415 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand 7 states. [2019-01-13 21:57:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:31,605 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2019-01-13 21:57:31,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:57:31,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-01-13 21:57:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:31,608 INFO L225 Difference]: With dead ends: 89 [2019-01-13 21:57:31,608 INFO L226 Difference]: Without dead ends: 89 [2019-01-13 21:57:31,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:57:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-13 21:57:31,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-13 21:57:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-13 21:57:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2019-01-13 21:57:31,613 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 34 [2019-01-13 21:57:31,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:31,613 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2019-01-13 21:57:31,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:57:31,613 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2019-01-13 21:57:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 21:57:31,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:31,617 INFO L402 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, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:31,617 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash -438463225, now seen corresponding path program 1 times [2019-01-13 21:57:31,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:31,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:31,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:31,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:31,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:32,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:32,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 21:57:32,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:57:32,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:57:32,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:32,220 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand 8 states. [2019-01-13 21:57:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:32,290 INFO L93 Difference]: Finished difference Result 130 states and 153 transitions. [2019-01-13 21:57:32,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 21:57:32,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-01-13 21:57:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:32,293 INFO L225 Difference]: With dead ends: 130 [2019-01-13 21:57:32,293 INFO L226 Difference]: Without dead ends: 130 [2019-01-13 21:57:32,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:57:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-13 21:57:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2019-01-13 21:57:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-13 21:57:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 148 transitions. [2019-01-13 21:57:32,300 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 148 transitions. Word has length 34 [2019-01-13 21:57:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:32,300 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 148 transitions. [2019-01-13 21:57:32,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:57:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2019-01-13 21:57:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 21:57:32,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:32,301 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:32,301 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:32,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:32,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2107320667, now seen corresponding path program 1 times [2019-01-13 21:57:32,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:32,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:32,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:32,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:32,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 21:57:32,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:32,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 21:57:32,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 21:57:32,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 21:57:32,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-01-13 21:57:32,616 INFO L87 Difference]: Start difference. First operand 124 states and 148 transitions. Second operand 13 states. [2019-01-13 21:57:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:33,198 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2019-01-13 21:57:33,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 21:57:33,199 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-01-13 21:57:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:33,201 INFO L225 Difference]: With dead ends: 146 [2019-01-13 21:57:33,202 INFO L226 Difference]: Without dead ends: 146 [2019-01-13 21:57:33,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:57:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-13 21:57:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2019-01-13 21:57:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-13 21:57:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 156 transitions. [2019-01-13 21:57:33,208 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 156 transitions. Word has length 37 [2019-01-13 21:57:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:33,208 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 156 transitions. [2019-01-13 21:57:33,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 21:57:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 156 transitions. [2019-01-13 21:57:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 21:57:33,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:33,211 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2019-01-13 21:57:33,213 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:33,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2076747943, now seen corresponding path program 2 times [2019-01-13 21:57:33,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:33,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:33,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:33,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:33,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:33,445 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-01-13 21:57:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:33,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:33,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:33,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:57:33,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:57:33,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:57:33,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:33,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:57:33,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:33,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:33,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:33,809 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:33,815 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:33,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:33,828 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:57:33,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:57:33,862 INFO L478 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 13 treesize of output 12 [2019-01-13 21:57:33,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:33,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:33,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:33,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-13 21:57:33,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-13 21:57:33,923 INFO L478 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 13 treesize of output 12 [2019-01-13 21:57:33,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:33,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:33,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:33,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-01-13 21:57:38,075 WARN L181 SmtUtils]: Spent 2.80 s on a formula simplification that was a NOOP. DAG size: 47 [2019-01-13 21:57:38,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 58 [2019-01-13 21:57:38,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 50 [2019-01-13 21:57:38,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:38,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2019-01-13 21:57:38,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:38,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 37 treesize of output 27 [2019-01-13 21:57:38,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 42 treesize of output 32 [2019-01-13 21:57:38,776 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 32 treesize of output 22 [2019-01-13 21:57:38,843 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2019-01-13 21:57:38,957 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:39,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 38 treesize of output 28 [2019-01-13 21:57:39,000 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:39,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 31 [2019-01-13 21:57:39,051 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:39,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:57:39,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:57:39,106 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:70, output treesize:61 [2019-01-13 21:57:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:39,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:39,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2019-01-13 21:57:39,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-13 21:57:39,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-13 21:57:39,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=528, Unknown=1, NotChecked=0, Total=600 [2019-01-13 21:57:39,377 INFO L87 Difference]: Start difference. First operand 129 states and 156 transitions. Second operand 25 states. [2019-01-13 21:57:40,243 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-01-13 21:57:40,732 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-01-13 21:57:45,504 WARN L181 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-01-13 21:57:45,708 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-01-13 21:57:47,916 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-01-13 21:57:51,134 WARN L181 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-01-13 21:57:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:51,380 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2019-01-13 21:57:51,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 21:57:51,381 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-01-13 21:57:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:51,383 INFO L225 Difference]: With dead ends: 132 [2019-01-13 21:57:51,383 INFO L226 Difference]: Without dead ends: 97 [2019-01-13 21:57:51,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=234, Invalid=1247, Unknown=1, NotChecked=0, Total=1482 [2019-01-13 21:57:51,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-13 21:57:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2019-01-13 21:57:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-13 21:57:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2019-01-13 21:57:51,388 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 37 [2019-01-13 21:57:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:51,388 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2019-01-13 21:57:51,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-13 21:57:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2019-01-13 21:57:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 21:57:51,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:51,389 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:51,390 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:51,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:51,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2089401125, now seen corresponding path program 1 times [2019-01-13 21:57:51,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:51,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:51,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:51,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:57:51,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 21:57:51,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:51,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:57:51,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:57:51,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:57:51,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:51,739 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand 8 states. [2019-01-13 21:57:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:52,001 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-01-13 21:57:52,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:57:52,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-01-13 21:57:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:52,004 INFO L225 Difference]: With dead ends: 89 [2019-01-13 21:57:52,004 INFO L226 Difference]: Without dead ends: 89 [2019-01-13 21:57:52,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:57:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-13 21:57:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-13 21:57:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-13 21:57:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2019-01-13 21:57:52,009 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 39 [2019-01-13 21:57:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:52,009 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2019-01-13 21:57:52,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:57:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2019-01-13 21:57:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 21:57:52,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:52,010 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:52,010 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:52,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:52,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2089401124, now seen corresponding path program 1 times [2019-01-13 21:57:52,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:52,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:52,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:52,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:52,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:52,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:52,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:52,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:52,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:52,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 15 [2019-01-13 21:57:52,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 21:57:52,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 21:57:52,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-01-13 21:57:52,457 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 16 states. [2019-01-13 21:57:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:52,847 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2019-01-13 21:57:52,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 21:57:52,848 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-01-13 21:57:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:52,850 INFO L225 Difference]: With dead ends: 100 [2019-01-13 21:57:52,850 INFO L226 Difference]: Without dead ends: 100 [2019-01-13 21:57:52,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-01-13 21:57:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-13 21:57:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2019-01-13 21:57:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-13 21:57:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2019-01-13 21:57:52,854 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 39 [2019-01-13 21:57:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:52,856 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2019-01-13 21:57:52,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 21:57:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2019-01-13 21:57:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 21:57:52,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:52,857 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:52,857 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:52,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2130216445, now seen corresponding path program 1 times [2019-01-13 21:57:52,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:52,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:52,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:52,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:52,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 21:57:52,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:52,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:57:52,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:57:52,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:57:52,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:57:52,959 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand 5 states. [2019-01-13 21:57:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:53,013 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2019-01-13 21:57:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:57:53,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-01-13 21:57:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:53,016 INFO L225 Difference]: With dead ends: 94 [2019-01-13 21:57:53,016 INFO L226 Difference]: Without dead ends: 94 [2019-01-13 21:57:53,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:57:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-13 21:57:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-01-13 21:57:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-13 21:57:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2019-01-13 21:57:53,022 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 41 [2019-01-13 21:57:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:53,022 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2019-01-13 21:57:53,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:57:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2019-01-13 21:57:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 21:57:53,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:53,023 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:53,024 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:53,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2130216444, now seen corresponding path program 1 times [2019-01-13 21:57:53,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:53,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:53,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:53,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 21:57:53,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:53,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:57:53,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:57:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:57:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:53,304 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 8 states. [2019-01-13 21:57:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:53,436 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2019-01-13 21:57:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:57:53,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-01-13 21:57:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:53,443 INFO L225 Difference]: With dead ends: 87 [2019-01-13 21:57:53,443 INFO L226 Difference]: Without dead ends: 87 [2019-01-13 21:57:53,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:57:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-13 21:57:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-13 21:57:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-13 21:57:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2019-01-13 21:57:53,449 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 41 [2019-01-13 21:57:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:53,451 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2019-01-13 21:57:53,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:57:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2019-01-13 21:57:53,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-13 21:57:53,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:53,454 INFO L402 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] [2019-01-13 21:57:53,454 INFO L423 AbstractCegarLoop]: === Iteration 23 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:57:53,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:53,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2136511264, now seen corresponding path program 1 times [2019-01-13 21:57:53,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:53,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:53,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:53,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:53,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 21:57:53,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:53,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:53,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:53,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:53,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:57:53,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:53,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:53,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:53,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:53,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:53,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:53,933 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:57:53,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:57:53,969 INFO L478 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 12 treesize of output 11 [2019-01-13 21:57:53,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:53,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:53,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:53,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-13 21:57:54,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-13 21:57:54,011 INFO L478 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 13 treesize of output 12 [2019-01-13 21:57:54,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:54,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:54,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:54,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-13 21:57:55,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-01-13 21:57:55,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 1 [2019-01-13 21:57:55,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:55,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2019-01-13 21:57:55,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:55,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:55,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:55,840 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2019-01-13 21:57:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 21:57:55,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:55,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2019-01-13 21:57:55,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-13 21:57:55,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-13 21:57:55,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=533, Unknown=1, NotChecked=0, Total=600 [2019-01-13 21:57:55,969 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand 25 states. [2019-01-13 21:57:57,594 WARN L181 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-01-13 21:57:58,228 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-01-13 21:57:58,438 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-01-13 21:57:58,627 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-01-13 21:58:01,074 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-01-13 21:58:01,409 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-01-13 21:58:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:01,967 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2019-01-13 21:58:01,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 21:58:01,969 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-01-13 21:58:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:01,972 INFO L225 Difference]: With dead ends: 107 [2019-01-13 21:58:01,972 INFO L226 Difference]: Without dead ends: 107 [2019-01-13 21:58:01,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=225, Invalid=1333, Unknown=2, NotChecked=0, Total=1560 [2019-01-13 21:58:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-13 21:58:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2019-01-13 21:58:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-13 21:58:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2019-01-13 21:58:01,977 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 42 [2019-01-13 21:58:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:01,978 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2019-01-13 21:58:01,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-13 21:58:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2019-01-13 21:58:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 21:58:01,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:01,978 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:58:01,982 INFO L423 AbstractCegarLoop]: === Iteration 24 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:58:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1561671395, now seen corresponding path program 1 times [2019-01-13 21:58:01,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:58:01,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:58:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:01,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 21:58:02,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:58:02,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:58:02,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:58:02,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:58:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:58:02,152 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 8 states. [2019-01-13 21:58:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:02,343 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-01-13 21:58:02,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:58:02,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-01-13 21:58:02,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:02,345 INFO L225 Difference]: With dead ends: 59 [2019-01-13 21:58:02,346 INFO L226 Difference]: Without dead ends: 59 [2019-01-13 21:58:02,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:58:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-13 21:58:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-13 21:58:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-13 21:58:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-01-13 21:58:02,351 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 43 [2019-01-13 21:58:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:02,352 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-01-13 21:58:02,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:58:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-01-13 21:58:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 21:58:02,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:02,352 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:58:02,353 INFO L423 AbstractCegarLoop]: === Iteration 25 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:58:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1561671394, now seen corresponding path program 1 times [2019-01-13 21:58:02,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:58:02,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:58:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:02,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:02,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:02,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:58:02,631 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:58:02,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:02,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:02,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:58:02,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2019-01-13 21:58:02,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 21:58:02,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 21:58:02,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-01-13 21:58:02,769 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 17 states. [2019-01-13 21:58:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:03,176 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2019-01-13 21:58:03,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 21:58:03,177 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-01-13 21:58:03,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:03,179 INFO L225 Difference]: With dead ends: 78 [2019-01-13 21:58:03,179 INFO L226 Difference]: Without dead ends: 78 [2019-01-13 21:58:03,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2019-01-13 21:58:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-13 21:58:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2019-01-13 21:58:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-13 21:58:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-01-13 21:58:03,182 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 43 [2019-01-13 21:58:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:03,182 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-01-13 21:58:03,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 21:58:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-01-13 21:58:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 21:58:03,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:03,186 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:58:03,186 INFO L423 AbstractCegarLoop]: === Iteration 26 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:58:03,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:03,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1556246018, now seen corresponding path program 1 times [2019-01-13 21:58:03,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:58:03,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:58:03,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:03,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:03,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:03,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:58:03,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:58:03,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:03,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:03,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:58:03,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:03,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:58:03,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:58:03,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:03,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:03,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:03,928 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:58:03,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:58:03,957 INFO L478 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 12 treesize of output 11 [2019-01-13 21:58:03,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:03,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:03,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:03,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-13 21:58:04,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-13 21:58:04,006 INFO L478 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 13 treesize of output 12 [2019-01-13 21:58:04,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:04,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:04,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:58:04,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-13 21:58:07,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2019-01-13 21:58:07,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:58:07,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:58:07,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-13 21:58:07,308 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:07,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:58:07,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:58:07,353 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-13 21:58:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:07,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:58:07,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 28 [2019-01-13 21:58:07,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-13 21:58:07,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-13 21:58:07,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=684, Unknown=1, NotChecked=0, Total=756 [2019-01-13 21:58:07,477 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 28 states. [2019-01-13 21:58:10,704 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-13 21:58:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:15,487 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2019-01-13 21:58:15,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-13 21:58:15,488 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-01-13 21:58:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:15,489 INFO L225 Difference]: With dead ends: 127 [2019-01-13 21:58:15,489 INFO L226 Difference]: Without dead ends: 89 [2019-01-13 21:58:15,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=330, Invalid=3091, Unknown=1, NotChecked=0, Total=3422 [2019-01-13 21:58:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-13 21:58:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-01-13 21:58:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-13 21:58:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2019-01-13 21:58:15,494 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 45 [2019-01-13 21:58:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:15,495 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2019-01-13 21:58:15,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-13 21:58:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2019-01-13 21:58:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 21:58:15,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:15,496 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2019-01-13 21:58:15,497 INFO L423 AbstractCegarLoop]: === Iteration 27 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:58:15,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:15,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1025891093, now seen corresponding path program 1 times [2019-01-13 21:58:15,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:58:15,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:58:15,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:15,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:15,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:15,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:58:15,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:58:15,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:16,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:16,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:58:16,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-01-13 21:58:16,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-13 21:58:16,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-13 21:58:16,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-01-13 21:58:16,644 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 21 states. [2019-01-13 21:58:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:17,162 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2019-01-13 21:58:17,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 21:58:17,164 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2019-01-13 21:58:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:17,165 INFO L225 Difference]: With dead ends: 82 [2019-01-13 21:58:17,165 INFO L226 Difference]: Without dead ends: 82 [2019-01-13 21:58:17,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-01-13 21:58:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-13 21:58:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2019-01-13 21:58:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 21:58:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-01-13 21:58:17,169 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 50 [2019-01-13 21:58:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:17,169 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-01-13 21:58:17,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-13 21:58:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-01-13 21:58:17,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 21:58:17,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:17,170 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2019-01-13 21:58:17,171 INFO L423 AbstractCegarLoop]: === Iteration 28 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:58:17,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:17,171 INFO L82 PathProgramCache]: Analyzing trace with hash -835581523, now seen corresponding path program 1 times [2019-01-13 21:58:17,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:58:17,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:58:17,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:17,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:17,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:17,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:58:17,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:58:17,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:17,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:17,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:58:17,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 18 [2019-01-13 21:58:17,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-13 21:58:17,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-13 21:58:17,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-01-13 21:58:17,815 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 19 states. [2019-01-13 21:58:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:18,442 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-01-13 21:58:18,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 21:58:18,444 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-01-13 21:58:18,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:18,445 INFO L225 Difference]: With dead ends: 96 [2019-01-13 21:58:18,445 INFO L226 Difference]: Without dead ends: 96 [2019-01-13 21:58:18,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-01-13 21:58:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-13 21:58:18,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2019-01-13 21:58:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-13 21:58:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-01-13 21:58:18,449 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 54 [2019-01-13 21:58:18,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:18,449 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-01-13 21:58:18,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-13 21:58:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-01-13 21:58:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 21:58:18,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:18,452 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:58:18,452 INFO L423 AbstractCegarLoop]: === Iteration 29 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:58:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash 431418061, now seen corresponding path program 2 times [2019-01-13 21:58:18,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:58:18,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:58:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:18,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:18,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:58:18,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:58:18,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:58:18,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:58:18,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:58:18,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:18,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:58:18,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:58:18,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:18,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:18,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:58:18,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:18,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:18,819 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-01-13 21:58:18,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:58:18,849 INFO L478 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 13 treesize of output 12 [2019-01-13 21:58:18,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:18,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:18,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:18,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-01-13 21:58:18,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-13 21:58:18,903 INFO L478 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 13 treesize of output 12 [2019-01-13 21:58:18,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:18,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:18,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:18,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-01-13 21:58:20,241 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-13 21:58:21,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2019-01-13 21:58:21,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:58:21,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:58:21,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-13 21:58:21,327 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:21,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:58:21,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-13 21:58:21,367 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2019-01-13 21:58:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:21,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:58:21,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23] total 34 [2019-01-13 21:58:21,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-13 21:58:21,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-13 21:58:21,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2019-01-13 21:58:21,561 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 34 states. [2019-01-13 21:58:24,579 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-01-13 21:58:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:25,220 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2019-01-13 21:58:25,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-13 21:58:25,222 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 56 [2019-01-13 21:58:25,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:25,224 INFO L225 Difference]: With dead ends: 135 [2019-01-13 21:58:25,224 INFO L226 Difference]: Without dead ends: 78 [2019-01-13 21:58:25,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=261, Invalid=2709, Unknown=0, NotChecked=0, Total=2970 [2019-01-13 21:58:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-13 21:58:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-13 21:58:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-13 21:58:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-01-13 21:58:25,230 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 56 [2019-01-13 21:58:25,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:25,230 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-01-13 21:58:25,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-13 21:58:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-01-13 21:58:25,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-13 21:58:25,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:25,231 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:58:25,231 INFO L423 AbstractCegarLoop]: === Iteration 30 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:58:25,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:25,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1701591007, now seen corresponding path program 3 times [2019-01-13 21:58:25,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:58:25,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:58:25,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:25,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:58:25,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:25,477 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-01-13 21:58:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 21:58:26,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:58:26,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:58:26,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 21:58:26,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-13 21:58:26,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:58:26,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:26,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:58:26,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:58:26,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:26,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:26,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:58:26,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:26,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:26,232 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-01-13 21:58:26,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:58:26,274 INFO L478 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 13 treesize of output 12 [2019-01-13 21:58:26,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:26,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:26,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:26,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2019-01-13 21:58:26,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-13 21:58:26,332 INFO L478 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 13 treesize of output 12 [2019-01-13 21:58:26,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:26,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:26,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:58:26,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-01-13 21:58:27,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-13 21:58:27,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 9 treesize of output 1 [2019-01-13 21:58:27,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:27,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:58:27,117 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:58:27,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:58:27,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:58:27,131 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-13 21:58:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-13 21:58:27,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:58:27,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 38 [2019-01-13 21:58:27,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-13 21:58:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-13 21:58:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1385, Unknown=0, NotChecked=0, Total=1482 [2019-01-13 21:58:27,264 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 39 states. [2019-01-13 21:58:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:31,060 INFO L93 Difference]: Finished difference Result 154 states and 177 transitions. [2019-01-13 21:58:31,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-13 21:58:31,062 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 59 [2019-01-13 21:58:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:31,063 INFO L225 Difference]: With dead ends: 154 [2019-01-13 21:58:31,063 INFO L226 Difference]: Without dead ends: 154 [2019-01-13 21:58:31,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=285, Invalid=3497, Unknown=0, NotChecked=0, Total=3782 [2019-01-13 21:58:31,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-13 21:58:31,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2019-01-13 21:58:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-13 21:58:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2019-01-13 21:58:31,071 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 59 [2019-01-13 21:58:31,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:31,071 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2019-01-13 21:58:31,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-13 21:58:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2019-01-13 21:58:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-13 21:58:31,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:31,072 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:58:31,072 INFO L423 AbstractCegarLoop]: === Iteration 31 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:58:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:31,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1153583650, now seen corresponding path program 2 times [2019-01-13 21:58:31,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:58:31,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:58:31,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:31,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:58:31,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:31,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:58:31,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:58:31,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:58:31,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:58:31,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:58:31,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 21:58:31,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:58:31,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2019-01-13 21:58:31,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-13 21:58:31,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-13 21:58:31,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2019-01-13 21:58:31,839 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand 28 states. [2019-01-13 21:58:32,590 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 21:58:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:33,113 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2019-01-13 21:58:33,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 21:58:33,115 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2019-01-13 21:58:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:33,117 INFO L225 Difference]: With dead ends: 197 [2019-01-13 21:58:33,117 INFO L226 Difference]: Without dead ends: 197 [2019-01-13 21:58:33,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=1473, Unknown=0, NotChecked=0, Total=1640 [2019-01-13 21:58:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-13 21:58:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 146. [2019-01-13 21:58:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-13 21:58:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 182 transitions. [2019-01-13 21:58:33,126 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 182 transitions. Word has length 61 [2019-01-13 21:58:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:33,127 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 182 transitions. [2019-01-13 21:58:33,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-13 21:58:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions. [2019-01-13 21:58:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 21:58:33,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:33,130 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-01-13 21:58:33,131 INFO L423 AbstractCegarLoop]: === Iteration 32 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:58:33,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:33,131 INFO L82 PathProgramCache]: Analyzing trace with hash -165341466, now seen corresponding path program 1 times [2019-01-13 21:58:33,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:58:33,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:58:33,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:33,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:58:33,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-13 21:58:34,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:58:34,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:58:34,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:34,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:34,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:58:34,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:58:34,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:34,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:34,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:58:34,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:34,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:34,145 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:58:34,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:58:34,184 INFO L478 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 12 treesize of output 11 [2019-01-13 21:58:34,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:34,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:34,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:34,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-13 21:58:34,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-13 21:58:34,238 INFO L478 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 13 treesize of output 12 [2019-01-13 21:58:34,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:34,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:34,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:58:34,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-13 21:58:37,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2019-01-13 21:58:37,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:58:37,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:58:37,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-13 21:58:37,616 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:37,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:58:37,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:58:37,652 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-13 21:58:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-13 21:58:37,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:58:37,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 43 [2019-01-13 21:58:37,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-13 21:58:37,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-13 21:58:37,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1745, Unknown=1, NotChecked=0, Total=1892 [2019-01-13 21:58:37,848 INFO L87 Difference]: Start difference. First operand 146 states and 182 transitions. Second operand 44 states. [2019-01-13 21:58:39,365 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-13 21:58:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:45,550 INFO L93 Difference]: Finished difference Result 192 states and 224 transitions. [2019-01-13 21:58:45,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-13 21:58:45,552 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 64 [2019-01-13 21:58:45,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:45,553 INFO L225 Difference]: With dead ends: 192 [2019-01-13 21:58:45,553 INFO L226 Difference]: Without dead ends: 192 [2019-01-13 21:58:45,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=466, Invalid=5083, Unknown=1, NotChecked=0, Total=5550 [2019-01-13 21:58:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-13 21:58:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 92. [2019-01-13 21:58:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-13 21:58:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2019-01-13 21:58:45,560 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 64 [2019-01-13 21:58:45,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:45,560 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2019-01-13 21:58:45,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-13 21:58:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2019-01-13 21:58:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 21:58:45,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:45,565 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2019-01-13 21:58:45,565 INFO L423 AbstractCegarLoop]: === Iteration 33 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:58:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash 679918436, now seen corresponding path program 2 times [2019-01-13 21:58:45,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:58:45,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:58:45,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:45,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:58:45,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:46,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:58:46,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:58:46,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:58:46,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 21:58:46,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:58:46,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-13 21:58:46,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 21:58:46,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 21 [2019-01-13 21:58:46,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 21:58:46,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 21:58:46,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-01-13 21:58:46,539 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand 22 states. [2019-01-13 21:58:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:47,519 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2019-01-13 21:58:47,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-13 21:58:47,521 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2019-01-13 21:58:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:47,523 INFO L225 Difference]: With dead ends: 116 [2019-01-13 21:58:47,523 INFO L226 Difference]: Without dead ends: 116 [2019-01-13 21:58:47,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2019-01-13 21:58:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-13 21:58:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 88. [2019-01-13 21:58:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-13 21:58:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2019-01-13 21:58:47,527 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 65 [2019-01-13 21:58:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:47,528 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2019-01-13 21:58:47,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 21:58:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2019-01-13 21:58:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 21:58:47,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:47,529 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:58:47,529 INFO L423 AbstractCegarLoop]: === Iteration 34 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:58:47,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:47,529 INFO L82 PathProgramCache]: Analyzing trace with hash 832965316, now seen corresponding path program 4 times [2019-01-13 21:58:47,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:58:47,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:58:47,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:47,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:58:47,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:58:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:58:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:48,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:58:48,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:58:48,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-13 21:58:48,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-13 21:58:48,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:58:48,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:48,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:58:48,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:58:48,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:48,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:48,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:58:48,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:48,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:48,303 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:58:48,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:58:48,351 INFO L478 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 12 treesize of output 11 [2019-01-13 21:58:48,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:48,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:48,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:48,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-13 21:58:48,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-13 21:58:48,411 INFO L478 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 13 treesize of output 12 [2019-01-13 21:58:48,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:48,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:48,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:58:48,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-13 21:58:53,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2019-01-13 21:58:53,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:58:53,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:58:53,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-13 21:58:53,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:53,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:58:53,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:58:53,846 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-13 21:58:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:58:54,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:58:54,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25] total 38 [2019-01-13 21:58:54,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-13 21:58:54,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-13 21:58:54,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1305, Unknown=2, NotChecked=0, Total=1406 [2019-01-13 21:58:54,004 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand 38 states. [2019-01-13 21:58:56,262 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-13 21:59:01,596 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-01-13 21:59:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:59:02,926 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2019-01-13 21:59:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-13 21:59:02,927 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 67 [2019-01-13 21:59:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:59:02,928 INFO L225 Difference]: With dead ends: 195 [2019-01-13 21:59:02,928 INFO L226 Difference]: Without dead ends: 119 [2019-01-13 21:59:02,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=474, Invalid=6166, Unknown=2, NotChecked=0, Total=6642 [2019-01-13 21:59:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-13 21:59:02,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-01-13 21:59:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-13 21:59:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2019-01-13 21:59:02,934 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 67 [2019-01-13 21:59:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:59:02,934 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2019-01-13 21:59:02,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-13 21:59:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2019-01-13 21:59:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-13 21:59:02,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:59:02,935 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:59:02,936 INFO L423 AbstractCegarLoop]: === Iteration 35 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:59:02,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:59:02,936 INFO L82 PathProgramCache]: Analyzing trace with hash 330781843, now seen corresponding path program 5 times [2019-01-13 21:59:02,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:59:02,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:59:02,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:02,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:59:02,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:03,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:59:03,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:59:03,229 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-13 21:59:15,433 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-01-13 21:59:15,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:59:15,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:59:15,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:59:15,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:15,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:59:15,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:59:15,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:15,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:15,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:15,492 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:59:15,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:59:15,520 INFO L478 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 13 treesize of output 12 [2019-01-13 21:59:15,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:15,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:15,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:15,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-01-13 21:59:15,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-13 21:59:15,573 INFO L478 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 13 treesize of output 12 [2019-01-13 21:59:15,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:15,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:15,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 21:59:15,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-01-13 21:59:18,287 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-01-13 21:59:21,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 58 [2019-01-13 21:59:21,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 48 [2019-01-13 21:59:21,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:21,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 42 treesize of output 32 [2019-01-13 21:59:21,264 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:21,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 35 [2019-01-13 21:59:21,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:21,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 41 [2019-01-13 21:59:21,436 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:21,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 23 [2019-01-13 21:59:21,497 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:21,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 3 [2019-01-13 21:59:21,501 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:21,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 36 treesize of output 26 [2019-01-13 21:59:21,541 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:21,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 16 [2019-01-13 21:59:21,590 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:21,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:59:21,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:59:21,660 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:72, output treesize:47 [2019-01-13 21:59:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-13 21:59:21,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:59:21,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2019-01-13 21:59:21,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-13 21:59:21,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-13 21:59:21,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=905, Unknown=1, NotChecked=0, Total=992 [2019-01-13 21:59:21,848 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 32 states. [2019-01-13 21:59:23,240 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-01-13 21:59:24,241 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-01-13 21:59:28,469 WARN L181 SmtUtils]: Spent 3.97 s on a formula simplification that was a NOOP. DAG size: 61 [2019-01-13 21:59:35,147 WARN L181 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-01-13 21:59:37,686 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-13 21:59:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:59:37,980 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2019-01-13 21:59:37,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-13 21:59:37,982 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 78 [2019-01-13 21:59:37,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:59:37,984 INFO L225 Difference]: With dead ends: 212 [2019-01-13 21:59:37,984 INFO L226 Difference]: Without dead ends: 124 [2019-01-13 21:59:37,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=428, Invalid=3731, Unknown=1, NotChecked=0, Total=4160 [2019-01-13 21:59:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-13 21:59:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 93. [2019-01-13 21:59:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-13 21:59:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2019-01-13 21:59:37,988 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 78 [2019-01-13 21:59:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:59:37,989 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2019-01-13 21:59:37,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-13 21:59:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2019-01-13 21:59:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 21:59:37,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:59:37,990 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:59:37,990 INFO L423 AbstractCegarLoop]: === Iteration 36 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-13 21:59:37,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:59:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1033657496, now seen corresponding path program 3 times [2019-01-13 21:59:37,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:59:37,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:59:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:37,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:59:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:38,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:59:38,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:59:38,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 21:59:38,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-13 21:59:38,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:59:38,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:59:38,623 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:59:38,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:59:38,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:38,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:59:38,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:38,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-13 21:59:38,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2019-01-13 21:59:38,691 INFO L478 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 12 treesize of output 11 [2019-01-13 21:59:38,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:38,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:38,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:38,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-13 21:59:38,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2019-01-13 21:59:38,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 21 [2019-01-13 21:59:38,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:39,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2019-01-13 21:59:39,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:39,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2019-01-13 21:59:39,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:39,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:59:39,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:59:39,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-01-13 21:59:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-13 21:59:39,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:59:39,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2019-01-13 21:59:39,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-13 21:59:39,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-13 21:59:39,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2019-01-13 21:59:39,317 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand 33 states. [2019-01-13 21:59:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:59:42,354 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2019-01-13 21:59:42,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-13 21:59:42,357 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 83 [2019-01-13 21:59:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:59:42,357 INFO L225 Difference]: With dead ends: 144 [2019-01-13 21:59:42,358 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:59:42,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=775, Invalid=5231, Unknown=0, NotChecked=0, Total=6006 [2019-01-13 21:59:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:59:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:59:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:59:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:59:42,360 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-01-13 21:59:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:59:42,361 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:59:42,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-13 21:59:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:59:42,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:59:42,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:59:42 BoogieIcfgContainer [2019-01-13 21:59:42,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:59:42,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:59:42,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:59:42,367 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:59:42,367 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:05" (3/4) ... [2019-01-13 21:59:42,371 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:59:42,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:59:42,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:59:42,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:59:42,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlen [2019-01-13 21:59:42,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:59:42,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2019-01-13 21:59:42,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrstr [2019-01-13 21:59:42,386 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-01-13 21:59:42,386 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-13 21:59:42,386 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 21:59:42,427 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:59:42,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:59:42,428 INFO L168 Benchmark]: Toolchain (without parser) took 158680.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.6 MB). Free memory was 951.4 MB in the beginning and 924.5 MB in the end (delta: 26.9 MB). Peak memory consumption was 298.4 MB. Max. memory is 11.5 GB. [2019-01-13 21:59:42,430 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:59:42,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 617.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-01-13 21:59:42,431 INFO L168 Benchmark]: Boogie Preprocessor took 70.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:59:42,431 INFO L168 Benchmark]: RCFGBuilder took 863.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-01-13 21:59:42,432 INFO L168 Benchmark]: TraceAbstraction took 157064.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.8 MB). Free memory was 1.1 GB in the beginning and 924.5 MB in the end (delta: 142.9 MB). Peak memory consumption was 268.8 MB. Max. memory is 11.5 GB. [2019-01-13 21:59:42,432 INFO L168 Benchmark]: Witness Printer took 60.86 ms. Allocated memory is still 1.3 GB. Free memory was 924.5 MB in the beginning and 924.5 MB in the end (delta: 17.3 kB). Peak memory consumption was 17.3 kB. Max. memory is 11.5 GB. [2019-01-13 21:59:42,434 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 617.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 863.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 157064.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.8 MB). Free memory was 1.1 GB in the beginning and 924.5 MB in the end (delta: 142.9 MB). Peak memory consumption was 268.8 MB. Max. memory is 11.5 GB. * Witness Printer took 60.86 ms. Allocated memory is still 1.3 GB. Free memory was 924.5 MB in the beginning and 924.5 MB in the end (delta: 17.3 kB). Peak memory consumption was 17.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 87 locations, 21 error locations. SAFE Result, 157.0s OverallTime, 36 OverallIterations, 6 TraceHistogramMax, 87.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2190 SDtfs, 4213 SDslu, 19641 SDs, 0 SdLazy, 16850 SolverSat, 1124 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 35.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1656 GetRequests, 737 SyntacticMatches, 16 SemanticMatches, 903 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7978 ImplicationChecksByTransitivity, 97.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 460 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 13.2s SatisfiabilityAnalysisTime, 55.0s InterpolantComputationTime, 2278 NumberOfCodeBlocks, 2242 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 2225 ConstructedInterpolants, 360 QuantifiedInterpolants, 1564407 SizeOfPredicates, 311 NumberOfNonLiveVariables, 4310 ConjunctsInSsa, 1011 ConjunctsInUnsatCore, 53 InterpolantComputations, 20 PerfectInterpolantSequences, 286/810 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...