./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrcmp-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/cstrcmp-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 bd1b17fffb471392e4e5cb414f885f337c434a14 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:55:56,682 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:55:56,684 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:55:56,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:55:56,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:55:56,697 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:55:56,699 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:55:56,701 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:55:56,703 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:55:56,704 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:55:56,705 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:55:56,705 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:55:56,706 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:55:56,707 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:55:56,709 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:55:56,710 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:55:56,711 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:55:56,713 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:55:56,715 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:55:56,717 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:55:56,719 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:55:56,720 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:55:56,724 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:55:56,724 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:55:56,724 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:55:56,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:55:56,727 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:55:56,728 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:55:56,729 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:55:56,731 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:55:56,731 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:55:56,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:55:56,732 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:55:56,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:55:56,734 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:55:56,735 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:55:56,736 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:55:56,752 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:55:56,753 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:55:56,754 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:55:56,754 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:55:56,754 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:55:56,754 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:55:56,755 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:55:56,755 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:55:56,756 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:55:56,756 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:55:56,756 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:55:56,756 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:55:56,756 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:55:56,756 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:55:56,757 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:55:56,758 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:55:56,758 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:55:56,758 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:55:56,758 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:55:56,759 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:55:56,759 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:55:56,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:55:56,760 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:55:56,760 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:55:56,760 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:55:56,760 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:55:56,760 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 -> bd1b17fffb471392e4e5cb414f885f337c434a14 [2019-01-13 21:55:56,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:55:56,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:55:56,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:55:56,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:55:56,815 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:55:56,816 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:55:56,879 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d464eeea/6dce17e087604b4c82a726858a1d1bc0/FLAGb94c92841 [2019-01-13 21:55:57,450 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:55:57,451 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:55:57,465 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d464eeea/6dce17e087604b4c82a726858a1d1bc0/FLAGb94c92841 [2019-01-13 21:55:57,747 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d464eeea/6dce17e087604b4c82a726858a1d1bc0 [2019-01-13 21:55:57,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:55:57,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:55:57,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:55:57,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:55:57,757 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:55:57,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:55:57" (1/1) ... [2019-01-13 21:55:57,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c58d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:57, skipping insertion in model container [2019-01-13 21:55:57,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:55:57" (1/1) ... [2019-01-13 21:55:57,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:55:57,823 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:55:58,139 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:55:58,155 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:55:58,286 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:55:58,339 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:55:58,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:58 WrapperNode [2019-01-13 21:55:58,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:55:58,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:55:58,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:55:58,341 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:55:58,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:58" (1/1) ... [2019-01-13 21:55:58,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:58" (1/1) ... [2019-01-13 21:55:58,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:58" (1/1) ... [2019-01-13 21:55:58,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:58" (1/1) ... [2019-01-13 21:55:58,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:58" (1/1) ... [2019-01-13 21:55:58,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:58" (1/1) ... [2019-01-13 21:55:58,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:58" (1/1) ... [2019-01-13 21:55:58,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:55:58,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:55:58,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:55:58,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:55:58,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:58" (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:55:58,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:55:58,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:55:58,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:55:58,460 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:55:58,460 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcmp [2019-01-13 21:55:58,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:55:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:55:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:55:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:55:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:55:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:55:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:55:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:55:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:55:58,462 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:55:58,462 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:55:58,462 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:55:58,462 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:55:58,462 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:55:58,462 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:55:58,463 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:55:58,463 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:55:58,463 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:55:58,463 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:55:58,463 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:55:58,463 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:55:58,464 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:55:58,464 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:55:58,464 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:55:58,464 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:55:58,464 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:55:58,464 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:55:58,465 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:55:58,465 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:55:58,465 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:55:58,465 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:55:58,465 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:55:58,465 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:55:58,466 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:55:58,466 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:55:58,466 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:55:58,466 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:55:58,466 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:55:58,466 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:55:58,467 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:55:58,467 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:55:58,467 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:55:58,467 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:55:58,467 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:55:58,467 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:55:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:55:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:55:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:55:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:55:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:55:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:55:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:55:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:55:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:55:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:55:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:55:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:55:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:55:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:55:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:55:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:55:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:55:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:55:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:55:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:55:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:55:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:55:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:55:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:55:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:55:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:55:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:55:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:55:58,472 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:55:58,472 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:55:58,472 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:55:58,472 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:55:58,472 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:55:58,472 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:55:58,472 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:55:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:55:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:55:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:55:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:55:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:55:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:55:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:55:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:55:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:55:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:55:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:55:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:55:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:55:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:55:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:55:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:55:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:55:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:55:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:55:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:55:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:55:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:55:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:55:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:55:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcmp [2019-01-13 21:55:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:55:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:55:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:55:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:55:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:55:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:55:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:55:59,190 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:55:59,192 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-13 21:55:59,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:55:59 BoogieIcfgContainer [2019-01-13 21:55:59,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:55:59,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:55:59,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:55:59,198 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:55:59,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:55:57" (1/3) ... [2019-01-13 21:55:59,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3700ce79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:55:59, skipping insertion in model container [2019-01-13 21:55:59,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:58" (2/3) ... [2019-01-13 21:55:59,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3700ce79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:55:59, skipping insertion in model container [2019-01-13 21:55:59,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:55:59" (3/3) ... [2019-01-13 21:55:59,201 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:55:59,212 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:55:59,223 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-13 21:55:59,240 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-13 21:55:59,267 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:55:59,268 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:55:59,268 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:55:59,268 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:55:59,269 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:55:59,269 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:55:59,269 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:55:59,270 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:55:59,270 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:55:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-01-13 21:55:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:55:59,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:55:59,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:55:59,301 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:55:59,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:55:59,307 INFO L82 PathProgramCache]: Analyzing trace with hash 290107144, now seen corresponding path program 1 times [2019-01-13 21:55:59,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:55:59,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:55:59,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:55:59,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:55:59,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:55:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:55:59,515 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:55:59,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:55:59,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:55:59,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:55:59,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:55:59,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:55:59,540 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-01-13 21:55:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:55:59,840 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-01-13 21:55:59,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:55:59,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:55:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:55:59,853 INFO L225 Difference]: With dead ends: 47 [2019-01-13 21:55:59,854 INFO L226 Difference]: Without dead ends: 44 [2019-01-13 21:55:59,856 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:55:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-13 21:55:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-13 21:55:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:55:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-01-13 21:55:59,898 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 10 [2019-01-13 21:55:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:55:59,899 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-01-13 21:55:59,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:55:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-01-13 21:55:59,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:55:59,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:55:59,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:55:59,900 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:55:59,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:55:59,901 INFO L82 PathProgramCache]: Analyzing trace with hash 290107145, now seen corresponding path program 1 times [2019-01-13 21:55:59,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:55:59,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:55:59,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:55:59,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:55:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:55:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:00,126 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-13 21:56:00,127 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:56:00,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:00,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:00,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:00,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:00,130 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-01-13 21:56:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:00,223 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-01-13 21:56:00,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:00,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:56:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:00,226 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:00,226 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:00,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:00,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 21:56:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-01-13 21:56:00,233 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 10 [2019-01-13 21:56:00,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:00,233 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-01-13 21:56:00,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-01-13 21:56:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:00,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:00,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:00,235 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:00,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:00,235 INFO L82 PathProgramCache]: Analyzing trace with hash 403386909, now seen corresponding path program 1 times [2019-01-13 21:56:00,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:00,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:00,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:00,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:00,296 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:56:00,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:00,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:00,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:00,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:00,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:00,297 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2019-01-13 21:56:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:00,391 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-01-13 21:56:00,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:00,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 21:56:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:00,393 INFO L225 Difference]: With dead ends: 42 [2019-01-13 21:56:00,393 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:56:00,393 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:56:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:56:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-13 21:56:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 21:56:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-13 21:56:00,400 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 11 [2019-01-13 21:56:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:00,400 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-13 21:56:00,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-13 21:56:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:00,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:00,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:00,402 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:00,402 INFO L82 PathProgramCache]: Analyzing trace with hash 403386910, now seen corresponding path program 1 times [2019-01-13 21:56:00,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:00,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:00,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:00,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:00,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:00,718 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-13 21:56:00,719 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:56:00,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:00,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:00,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:00,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:00,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:00,722 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-01-13 21:56:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:00,751 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-01-13 21:56:00,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:00,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:56:00,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:00,755 INFO L225 Difference]: With dead ends: 41 [2019-01-13 21:56:00,755 INFO L226 Difference]: Without dead ends: 41 [2019-01-13 21:56:00,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-13 21:56:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-13 21:56:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 21:56:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-01-13 21:56:00,761 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2019-01-13 21:56:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:00,761 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-13 21:56:00,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-01-13 21:56:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:56:00,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:00,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:00,763 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:00,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:00,763 INFO L82 PathProgramCache]: Analyzing trace with hash -19041991, now seen corresponding path program 1 times [2019-01-13 21:56:00,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:00,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:00,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:00,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:00,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:00,838 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:56:00,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:00,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:00,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:00,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:00,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:00,842 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-01-13 21:56:01,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:01,260 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-01-13 21:56:01,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:01,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-13 21:56:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:01,262 INFO L225 Difference]: With dead ends: 38 [2019-01-13 21:56:01,263 INFO L226 Difference]: Without dead ends: 38 [2019-01-13 21:56:01,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:01,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-13 21:56:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-13 21:56:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-13 21:56:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-01-13 21:56:01,268 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 14 [2019-01-13 21:56:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:01,268 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-01-13 21:56:01,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-01-13 21:56:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:56:01,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:01,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:01,270 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash -19041990, now seen corresponding path program 1 times [2019-01-13 21:56:01,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:01,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:01,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:01,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:01,433 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:56:01,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:01,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:01,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:01,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:01,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:01,435 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2019-01-13 21:56:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:01,655 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-01-13 21:56:01,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:01,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-13 21:56:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:01,660 INFO L225 Difference]: With dead ends: 57 [2019-01-13 21:56:01,661 INFO L226 Difference]: Without dead ends: 57 [2019-01-13 21:56:01,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-13 21:56:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2019-01-13 21:56:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 21:56:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-01-13 21:56:01,669 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 14 [2019-01-13 21:56:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:01,669 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-01-13 21:56:01,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-01-13 21:56:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:01,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:01,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:01,671 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2083064079, now seen corresponding path program 1 times [2019-01-13 21:56:01,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:01,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:01,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:01,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:01,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:01,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:01,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:01,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:01,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:01,726 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 3 states. [2019-01-13 21:56:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:01,742 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-01-13 21:56:01,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:01,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-13 21:56:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:01,745 INFO L225 Difference]: With dead ends: 48 [2019-01-13 21:56:01,745 INFO L226 Difference]: Without dead ends: 48 [2019-01-13 21:56:01,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:56:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-13 21:56:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-13 21:56:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 21:56:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-01-13 21:56:01,752 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 18 [2019-01-13 21:56:01,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:01,752 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-01-13 21:56:01,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-01-13 21:56:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:01,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:01,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:01,755 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:01,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2083073153, now seen corresponding path program 1 times [2019-01-13 21:56:01,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:01,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:01,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:01,828 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:56:01,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:01,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:01,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:01,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:01,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:01,830 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 5 states. [2019-01-13 21:56:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:01,941 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-01-13 21:56:01,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:01,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-13 21:56:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:01,943 INFO L225 Difference]: With dead ends: 46 [2019-01-13 21:56:01,943 INFO L226 Difference]: Without dead ends: 46 [2019-01-13 21:56:01,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-13 21:56:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-13 21:56:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 21:56:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-01-13 21:56:01,949 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 18 [2019-01-13 21:56:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:01,949 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-01-13 21:56:01,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-01-13 21:56:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:01,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:01,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:01,950 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:01,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:01,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2083073152, now seen corresponding path program 1 times [2019-01-13 21:56:01,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:01,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:01,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:01,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:02,136 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:56:02,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:02,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:02,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:02,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:02,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:02,139 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 7 states. [2019-01-13 21:56:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:02,280 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-01-13 21:56:02,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:02,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-13 21:56:02,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:02,283 INFO L225 Difference]: With dead ends: 53 [2019-01-13 21:56:02,283 INFO L226 Difference]: Without dead ends: 53 [2019-01-13 21:56:02,283 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:56:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-13 21:56:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-01-13 21:56:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 21:56:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-01-13 21:56:02,288 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 18 [2019-01-13 21:56:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:02,289 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-01-13 21:56:02,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-01-13 21:56:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 21:56:02,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:02,290 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:56:02,290 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:02,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:02,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1150149187, now seen corresponding path program 1 times [2019-01-13 21:56:02,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:02,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:02,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:02,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:02,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:02,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:02,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 21:56:02,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 21:56:02,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 21:56:02,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:02,658 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2019-01-13 21:56:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:03,002 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2019-01-13 21:56:03,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 21:56:03,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-01-13 21:56:03,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:03,004 INFO L225 Difference]: With dead ends: 69 [2019-01-13 21:56:03,004 INFO L226 Difference]: Without dead ends: 69 [2019-01-13 21:56:03,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-13 21:56:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-13 21:56:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-01-13 21:56:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-13 21:56:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2019-01-13 21:56:03,012 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 21 [2019-01-13 21:56:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:03,013 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2019-01-13 21:56:03,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 21:56:03,013 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2019-01-13 21:56:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 21:56:03,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:03,014 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:56:03,014 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:03,015 INFO L82 PathProgramCache]: Analyzing trace with hash -129714491, now seen corresponding path program 1 times [2019-01-13 21:56:03,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:03,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:03,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:03,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:03,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:03,553 WARN L181 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-13 21:56:03,817 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:56:03,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:03,818 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:56:03,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:03,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:04,002 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 11 treesize of output 8 [2019-01-13 21:56: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 8 treesize of output 7 [2019-01-13 21:56:04,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:04,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:04,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:04,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-13 21:56:04,588 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 30 treesize of output 30 [2019-01-13 21:56:04,593 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 26 treesize of output 19 [2019-01-13 21:56:04,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:04,615 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 19 treesize of output 12 [2019-01-13 21:56:04,616 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:04,693 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 12 [2019-01-13 21:56:04,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:04,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:04,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:04,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:30, output treesize:8 [2019-01-13 21:56:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:04,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 21:56:04,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 21 [2019-01-13 21:56:04,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-13 21:56:04,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-13 21:56:04,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-01-13 21:56:04,884 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 21 states. [2019-01-13 21:56:05,372 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-01-13 21:56:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:07,411 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2019-01-13 21:56:07,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-13 21:56:07,412 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-13 21:56:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:07,415 INFO L225 Difference]: With dead ends: 146 [2019-01-13 21:56:07,415 INFO L226 Difference]: Without dead ends: 146 [2019-01-13 21:56:07,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=305, Invalid=1587, Unknown=0, NotChecked=0, Total=1892 [2019-01-13 21:56:07,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-13 21:56:07,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2019-01-13 21:56:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-13 21:56:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2019-01-13 21:56:07,426 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 21 [2019-01-13 21:56:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:07,426 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2019-01-13 21:56:07,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-13 21:56:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2019-01-13 21:56:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-13 21:56:07,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:07,428 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:07,428 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:07,428 INFO L82 PathProgramCache]: Analyzing trace with hash -824303671, now seen corresponding path program 1 times [2019-01-13 21:56:07,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:07,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:07,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:07,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:07,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:07,857 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:56:07,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:07,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:07,913 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 14 treesize of output 11 [2019-01-13 21:56:07,918 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:56:07,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:07,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:07,931 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:56:07,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-13 21:56:08,400 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 33 treesize of output 33 [2019-01-13 21:56:08,416 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 29 treesize of output 27 [2019-01-13 21:56:08,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:08,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2019-01-13 21:56:08,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-13 21:56:08,557 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 19 treesize of output 12 [2019-01-13 21:56:08,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:08,560 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 23 treesize of output 16 [2019-01-13 21:56:08,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:08,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-13 21:56:08,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:56:08,696 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:49, output treesize:66 [2019-01-13 21:56:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:08,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:08,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-01-13 21:56:08,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-13 21:56:08,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-13 21:56:08,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-01-13 21:56:08,859 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand 23 states. [2019-01-13 21:56:09,549 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-01-13 21:56:09,698 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-01-13 21:56:10,087 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-01-13 21:56:10,281 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-01-13 21:56:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:11,294 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2019-01-13 21:56:11,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 21:56:11,295 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-01-13 21:56:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:11,297 INFO L225 Difference]: With dead ends: 124 [2019-01-13 21:56:11,297 INFO L226 Difference]: Without dead ends: 124 [2019-01-13 21:56:11,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2019-01-13 21:56:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-13 21:56:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 93. [2019-01-13 21:56:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-13 21:56:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-01-13 21:56:11,305 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 25 [2019-01-13 21:56:11,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:11,306 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-01-13 21:56:11,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-13 21:56:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-01-13 21:56:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 21:56:11,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:11,307 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:56:11,307 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:11,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash -67902013, now seen corresponding path program 1 times [2019-01-13 21:56:11,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:11,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:11,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:11,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:11,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:56:11,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:11,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:11,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:11,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:11,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:11,396 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 4 states. [2019-01-13 21:56:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:11,461 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2019-01-13 21:56:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:11,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-01-13 21:56:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:11,464 INFO L225 Difference]: With dead ends: 92 [2019-01-13 21:56:11,464 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:11,465 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:56:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 21:56:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-13 21:56:11,467 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 27 [2019-01-13 21:56:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:11,468 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-13 21:56:11,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-13 21:56:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:11,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:11,469 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:11,469 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1792296282, now seen corresponding path program 1 times [2019-01-13 21:56:11,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:11,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:11,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:11,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:11,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:11,678 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-13 21:56:12,243 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:56:12,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:12,243 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:56:12,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:12,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:12,313 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:56:12,318 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:56:12,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:12,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:12,338 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:56:12,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:12,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:12,344 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:56:12,382 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:56:12,384 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:56:12,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:12,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:12,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:12,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-13 21:56:12,427 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:56:12,430 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:56:12,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:12,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:12,444 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:56:12,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-13 21:56:12,669 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 31 treesize of output 29 [2019-01-13 21:56:12,672 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:56:12,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:12,688 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:56:12,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:12,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:12,704 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:56:12,705 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2019-01-13 21:56:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:12,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:12,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2019-01-13 21:56:12,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 21:56:12,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 21:56:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:56:12,831 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 20 states. [2019-01-13 21:56:13,470 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-01-13 21:56:13,656 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-01-13 21:56:13,898 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-13 21:56:14,550 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-01-13 21:56:14,742 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-01-13 21:56:16,869 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-01-13 21:56:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:16,993 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-13 21:56:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 21:56:16,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-01-13 21:56:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:16,995 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:56:16,995 INFO L226 Difference]: Without dead ends: 44 [2019-01-13 21:56:16,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2019-01-13 21:56:16,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-13 21:56:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-01-13 21:56:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:56:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-13 21:56:17,000 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 28 [2019-01-13 21:56:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:17,000 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-13 21:56:17,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 21:56:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-13 21:56:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 21:56:17,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:17,001 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:17,001 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:17,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:17,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1308190816, now seen corresponding path program 2 times [2019-01-13 21:56:17,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:17,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:17,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:17,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:17,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:17,263 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-13 21:56:17,673 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:56:17,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:17,674 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:56:17,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:17,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:56:17,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:17,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:17,744 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:56:17,832 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:56:17,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:17,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:17,856 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:56:17,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-13 21:56:17,876 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 16 treesize of output 13 [2019-01-13 21:56:17,878 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:56:17,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-01-13 21:56:18,311 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 35 treesize of output 35 [2019-01-13 21:56:18,315 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 31 treesize of output 24 [2019-01-13 21:56:18,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:18,341 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 24 treesize of output 22 [2019-01-13 21:56:18,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:18,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 35 [2019-01-13 21:56:18,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-01-13 21:56:18,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-13 21:56:18,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:56:18,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:98 [2019-01-13 21:56:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:18,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:18,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-01-13 21:56:18,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-13 21:56:18,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-13 21:56:18,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2019-01-13 21:56:18,735 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 25 states. [2019-01-13 21:56:19,857 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-01-13 21:56:20,014 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-01-13 21:56:20,455 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-13 21:56:20,916 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-01-13 21:56:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:21,363 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-13 21:56:21,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-13 21:56:21,365 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2019-01-13 21:56:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:21,365 INFO L225 Difference]: With dead ends: 41 [2019-01-13 21:56:21,365 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:56:21,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=317, Invalid=1663, Unknown=0, NotChecked=0, Total=1980 [2019-01-13 21:56:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:56:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:56:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:56:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:56:21,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-01-13 21:56:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:21,368 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:56:21,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-13 21:56:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:56:21,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:56:21,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:56:21 BoogieIcfgContainer [2019-01-13 21:56:21,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:56:21,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:56:21,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:56:21,374 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:56:21,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:55:59" (3/4) ... [2019-01-13 21:56:21,377 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:56:21,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:56:21,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcmp [2019-01-13 21:56:21,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:56:21,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:56:21,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:56:21,391 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-01-13 21:56:21,391 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-13 21:56:21,391 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 21:56:21,458 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:56:21,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:56:21,459 INFO L168 Benchmark]: Toolchain (without parser) took 23707.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.7 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -368.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:21,460 INFO L168 Benchmark]: CDTParser took 0.16 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:56:21,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:21,461 INFO L168 Benchmark]: Boogie Preprocessor took 58.29 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:56:21,461 INFO L168 Benchmark]: RCFGBuilder took 794.55 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:21,464 INFO L168 Benchmark]: TraceAbstraction took 22178.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -236.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:21,464 INFO L168 Benchmark]: Witness Printer took 84.46 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:21,468 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.16 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 586.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.29 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 794.55 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22178.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -236.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 84.46 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 54 locations, 15 error locations. SAFE Result, 22.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 998 SDslu, 1878 SDs, 0 SdLazy, 2102 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=11, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 105 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 365 ConstructedInterpolants, 31 QuantifiedInterpolants, 86456 SizeOfPredicates, 48 NumberOfNonLiveVariables, 562 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 9/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...