./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa 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-realloc/array-realloc_true-valid-memsafety.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 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:14:54,841 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:14:54,843 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:14:54,856 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:14:54,856 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:14:54,857 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:14:54,859 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:14:54,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:14:54,863 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:14:54,864 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:14:54,865 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:14:54,865 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:14:54,866 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:14:54,868 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:14:54,869 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:14:54,870 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:14:54,871 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:14:54,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:14:54,875 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:14:54,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:14:54,879 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:14:54,880 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:14:54,883 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:14:54,883 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:14:54,883 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:14:54,885 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:14:54,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:14:54,886 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:14:54,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:14:54,889 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:14:54,889 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:14:54,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:14:54,891 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:14:54,891 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:14:54,892 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:14:54,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:14:54,893 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:14:54,923 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:14:54,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:14:54,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:14:54,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:14:54,926 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:14:54,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:14:54,926 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:14:54,927 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:14:54,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:14:54,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:14:54,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:14:54,927 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:14:54,927 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:14:54,928 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:14:54,928 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:14:54,928 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:14:54,929 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:14:54,929 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:14:54,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:14:54,929 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:14:54,929 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:14:54,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:14:54,932 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:14:54,932 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:14:54,932 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:14:54,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:14:54,933 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 -> 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc [2019-01-01 17:14:54,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:14:54,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:14:55,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:14:55,006 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:14:55,007 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:14:55,007 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_true-valid-memsafety.i [2019-01-01 17:14:55,072 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c6483b6/c2b0f8fcee8b48548178a3ee4a01c6e1/FLAGf66d7a0e6 [2019-01-01 17:14:55,549 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:14:55,550 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_true-valid-memsafety.i [2019-01-01 17:14:55,571 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c6483b6/c2b0f8fcee8b48548178a3ee4a01c6e1/FLAGf66d7a0e6 [2019-01-01 17:14:55,861 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c6483b6/c2b0f8fcee8b48548178a3ee4a01c6e1 [2019-01-01 17:14:55,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:14:55,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:14:55,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:14:55,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:14:55,871 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:14:55,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:14:55" (1/1) ... [2019-01-01 17:14:55,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3148c2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:55, skipping insertion in model container [2019-01-01 17:14:55,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:14:55" (1/1) ... [2019-01-01 17:14:55,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:14:55,934 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:14:56,352 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:14:56,371 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:14:56,511 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:14:56,571 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:14:56,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:56 WrapperNode [2019-01-01 17:14:56,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:14:56,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:14:56,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:14:56,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:14:56,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:56" (1/1) ... [2019-01-01 17:14:56,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:56" (1/1) ... [2019-01-01 17:14:56,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:56" (1/1) ... [2019-01-01 17:14:56,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:56" (1/1) ... [2019-01-01 17:14:56,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:56" (1/1) ... [2019-01-01 17:14:56,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:56" (1/1) ... [2019-01-01 17:14:56,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:56" (1/1) ... [2019-01-01 17:14:56,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:14:56,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:14:56,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:14:56,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:14:56,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:56" (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-01 17:14:56,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:14:56,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:14:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:14:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:14:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure expandArray [2019-01-01 17:14:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:14:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2019-01-01 17:14:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:14:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:14:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:14:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:14:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:14:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:14:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:14:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:14:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:14:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:14:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:14:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:14:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:14:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:14:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:14:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:14:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:14:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:14:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:14:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:14:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:14:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:14:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:14:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:14:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:14:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:14:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:14:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:14:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:14:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:14:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:14:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:14:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:14:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:14:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:14:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:14:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:14:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:14:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:14:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:14:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:14:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:14:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:14:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:14:56,721 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:14:56,721 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:14:56,721 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:14:56,721 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:14:56,721 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:14:56,721 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:14:56,721 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:14:56,721 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:14:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:14:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:14:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:14:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:14:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:14:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:14:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:14:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:14:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-01 17:14:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:14:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:14:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-01 17:14:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:14:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:14:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-01 17:14:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:14:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:14:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:14:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:14:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:14:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:14:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:14:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:14:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:14:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:14:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:14:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:14:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:14:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:14:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:14:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:14:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:14:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:14:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:14:56,727 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:14:56,727 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:14:56,727 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:14:56,727 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:14:56,727 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:14:56,727 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:14:56,728 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:14:56,728 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:14:56,728 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:14:56,728 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:14:56,728 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:14:56,728 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:14:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:14:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:14:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:14:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:14:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:14:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:14:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:14:56,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:14:56,730 INFO L130 BoogieDeclarations]: Found specification of procedure expandArray [2019-01-01 17:14:56,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2019-01-01 17:14:56,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 17:14:56,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:14:56,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 17:14:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:14:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:14:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:14:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 17:14:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:14:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:14:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:14:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:14:57,390 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:14:57,390 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 17:14:57,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:57 BoogieIcfgContainer [2019-01-01 17:14:57,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:14:57,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:14:57,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:14:57,398 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:14:57,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:14:55" (1/3) ... [2019-01-01 17:14:57,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3151e79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:14:57, skipping insertion in model container [2019-01-01 17:14:57,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:56" (2/3) ... [2019-01-01 17:14:57,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3151e79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:14:57, skipping insertion in model container [2019-01-01 17:14:57,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:57" (3/3) ... [2019-01-01 17:14:57,403 INFO L112 eAbstractionObserver]: Analyzing ICFG array-realloc_true-valid-memsafety.i [2019-01-01 17:14:57,416 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:14:57,426 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-01-01 17:14:57,446 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-01-01 17:14:57,476 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:14:57,477 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:14:57,478 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:14:57,478 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:14:57,479 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:14:57,479 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:14:57,479 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:14:57,479 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:14:57,480 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:14:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-01-01 17:14:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 17:14:57,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:57,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:57,521 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:57,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash 529620371, now seen corresponding path program 1 times [2019-01-01 17:14:57,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:57,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:57,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:57,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:57,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:57,725 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-01 17:14:57,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:57,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:14:57,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:14:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:14:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:14:57,749 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-01-01 17:14:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:58,228 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-01-01 17:14:58,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:14:58,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-01 17:14:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:58,243 INFO L225 Difference]: With dead ends: 56 [2019-01-01 17:14:58,243 INFO L226 Difference]: Without dead ends: 52 [2019-01-01 17:14:58,245 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-01 17:14:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-01 17:14:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2019-01-01 17:14:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 17:14:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-01-01 17:14:58,298 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 8 [2019-01-01 17:14:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:58,298 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-01-01 17:14:58,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:14:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-01-01 17:14:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 17:14:58,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:58,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:58,300 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:58,300 INFO L82 PathProgramCache]: Analyzing trace with hash 529620385, now seen corresponding path program 1 times [2019-01-01 17:14:58,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:58,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:58,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:58,476 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-01 17:14:58,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:58,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:14:58,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:14:58,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:14:58,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:14:58,479 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 3 states. [2019-01-01 17:14:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:58,564 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-01 17:14:58,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:14:58,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-01 17:14:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:58,567 INFO L225 Difference]: With dead ends: 43 [2019-01-01 17:14:58,567 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 17:14:58,568 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-01 17:14:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 17:14:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-01 17:14:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 17:14:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-01-01 17:14:58,574 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 8 [2019-01-01 17:14:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:58,575 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-01-01 17:14:58,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:14:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-01-01 17:14:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 17:14:58,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:58,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:58,576 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash 529620384, now seen corresponding path program 1 times [2019-01-01 17:14:58,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:58,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:58,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:58,651 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-01 17:14:58,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:58,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:14:58,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:14:58,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:14:58,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:14:58,652 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2019-01-01 17:14:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:58,886 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-01-01 17:14:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:14:58,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-01 17:14:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:58,889 INFO L225 Difference]: With dead ends: 42 [2019-01-01 17:14:58,889 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 17:14:58,891 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-01 17:14:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 17:14:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-01 17:14:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 17:14:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-01-01 17:14:58,902 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2019-01-01 17:14:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:58,902 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-01-01 17:14:58,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:14:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-01-01 17:14:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:14:58,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:58,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:58,909 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2135919539, now seen corresponding path program 1 times [2019-01-01 17:14:58,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:58,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:58,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:58,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:59,087 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-01 17:14:59,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:59,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:14:59,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:14:59,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:14:59,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:14:59,090 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2019-01-01 17:14:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:59,366 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-01 17:14:59,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:14:59,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:14:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:59,369 INFO L225 Difference]: With dead ends: 42 [2019-01-01 17:14:59,369 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 17:14:59,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:14:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 17:14:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-01 17:14:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 17:14:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-01-01 17:14:59,384 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 10 [2019-01-01 17:14:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:59,385 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-01-01 17:14:59,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:14:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-01-01 17:14:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 17:14:59,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:59,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:59,390 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:59,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:59,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436269, now seen corresponding path program 1 times [2019-01-01 17:14:59,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:59,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:59,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:59,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:59,565 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-01 17:14:59,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:59,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:14:59,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:14:59,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:14:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:14:59,567 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 5 states. [2019-01-01 17:14:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:59,838 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-01-01 17:14:59,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:14:59,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-01 17:14:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:59,839 INFO L225 Difference]: With dead ends: 53 [2019-01-01 17:14:59,839 INFO L226 Difference]: Without dead ends: 53 [2019-01-01 17:14:59,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:14:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-01 17:14:59,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-01-01 17:14:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 17:14:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-01-01 17:14:59,848 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2019-01-01 17:14:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:59,848 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-01-01 17:14:59,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:14:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-01-01 17:14:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 17:14:59,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:59,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:59,849 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:59,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:59,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436268, now seen corresponding path program 1 times [2019-01-01 17:14:59,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:59,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:59,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:59,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:59,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:59,957 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-01 17:14:59,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:59,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:14:59,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:14:59,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:14:59,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:14:59,959 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2019-01-01 17:15:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:00,157 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-01-01 17:15:00,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:15:00,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-01 17:15:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:00,159 INFO L225 Difference]: With dead ends: 49 [2019-01-01 17:15:00,160 INFO L226 Difference]: Without dead ends: 49 [2019-01-01 17:15:00,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:15:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-01 17:15:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-01-01 17:15:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 17:15:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-01-01 17:15:00,166 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2019-01-01 17:15:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:00,166 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-01-01 17:15:00,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:15:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-01-01 17:15:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:15:00,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:00,167 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-01 17:15:00,168 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2119265845, now seen corresponding path program 1 times [2019-01-01 17:15:00,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:00,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:00,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:00,307 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-01 17:15:00,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:15:00,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:15:00,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:15:00,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:15:00,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:15:00,308 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2019-01-01 17:15:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:00,445 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-01-01 17:15:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:15:00,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-01 17:15:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:00,447 INFO L225 Difference]: With dead ends: 43 [2019-01-01 17:15:00,447 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 17:15:00,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:15:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 17:15:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-01 17:15:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 17:15:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-01-01 17:15:00,452 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 18 [2019-01-01 17:15:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:00,452 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-01-01 17:15:00,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:15:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-01-01 17:15:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:15:00,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:00,454 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] [2019-01-01 17:15:00,454 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:00,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2000066657, now seen corresponding path program 1 times [2019-01-01 17:15:00,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:00,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:00,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:00,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:00,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:00,560 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-01 17:15:00,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:15:00,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:15:00,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:15:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:15:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:15:00,561 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 5 states. [2019-01-01 17:15:00,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:00,674 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-01 17:15:00,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:15:00,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-01 17:15:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:00,676 INFO L225 Difference]: With dead ends: 43 [2019-01-01 17:15:00,676 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 17:15:00,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:15:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 17:15:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-01 17:15:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 17:15:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-01-01 17:15:00,683 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 20 [2019-01-01 17:15:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:00,684 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-01-01 17:15:00,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:15:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-01-01 17:15:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:15:00,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:00,685 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] [2019-01-01 17:15:00,685 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:00,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2000066658, now seen corresponding path program 1 times [2019-01-01 17:15:00,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:00,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:00,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:00,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:00,841 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-01 17:15:00,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:15:00,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:15:00,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:15:00,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:15:00,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:15:00,845 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 9 states. [2019-01-01 17:15:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:01,069 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-01 17:15:01,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:15:01,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-01 17:15:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:01,071 INFO L225 Difference]: With dead ends: 46 [2019-01-01 17:15:01,071 INFO L226 Difference]: Without dead ends: 46 [2019-01-01 17:15:01,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-01 17:15:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-01 17:15:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-01-01 17:15:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 17:15:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-01 17:15:01,078 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2019-01-01 17:15:01,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:01,078 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-01 17:15:01,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:15:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-01 17:15:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:15:01,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:01,081 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] [2019-01-01 17:15:01,081 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:01,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:01,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2028695809, now seen corresponding path program 1 times [2019-01-01 17:15:01,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:01,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:01,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:01,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:01,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:01,410 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-01 17:15:01,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:15:01,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:15:01,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:15:01,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:15:01,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:15:01,415 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2019-01-01 17:15:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:01,573 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-01-01 17:15:01,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:15:01,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-01-01 17:15:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:01,576 INFO L225 Difference]: With dead ends: 44 [2019-01-01 17:15:01,576 INFO L226 Difference]: Without dead ends: 44 [2019-01-01 17:15:01,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:15:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-01 17:15:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-01 17:15:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 17:15:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-01-01 17:15:01,582 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 20 [2019-01-01 17:15:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:01,582 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-01-01 17:15:01,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:15:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-01-01 17:15:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:15:01,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:01,583 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-01 17:15:01,584 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:01,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939367, now seen corresponding path program 1 times [2019-01-01 17:15:01,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:01,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:01,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:02,089 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-01 17:15:02,341 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-01 17:15:02,385 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-01 17:15:02,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:15:02,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:15:02,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:15:02,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:15:02,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:15:02,386 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 9 states. [2019-01-01 17:15:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:03,011 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-01-01 17:15:03,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:15:03,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-01-01 17:15:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:03,017 INFO L225 Difference]: With dead ends: 51 [2019-01-01 17:15:03,017 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 17:15:03,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:15:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 17:15:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-01 17:15:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 17:15:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-01-01 17:15:03,023 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 21 [2019-01-01 17:15:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:03,023 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-01-01 17:15:03,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:15:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-01-01 17:15:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:15:03,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:03,024 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-01 17:15:03,025 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939366, now seen corresponding path program 1 times [2019-01-01 17:15:03,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:03,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:03,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:03,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:03,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:03,363 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-01 17:15:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:15:03,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:15:03,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:15:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:15:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:15:03,365 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2019-01-01 17:15:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:03,669 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-01 17:15:03,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:15:03,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-01-01 17:15:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:03,672 INFO L225 Difference]: With dead ends: 45 [2019-01-01 17:15:03,672 INFO L226 Difference]: Without dead ends: 45 [2019-01-01 17:15:03,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:15:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-01 17:15:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-01 17:15:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 17:15:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-01-01 17:15:03,677 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 21 [2019-01-01 17:15:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:03,677 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-01-01 17:15:03,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:15:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-01-01 17:15:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:15:03,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:03,678 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] [2019-01-01 17:15:03,679 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:03,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1895188378, now seen corresponding path program 1 times [2019-01-01 17:15:03,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:03,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:03,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:03,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:03,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:03,930 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-01 17:15:03,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:15:03,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:15:03,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:15:03,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:15:03,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:15:03,932 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-01-01 17:15:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:03,978 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-01-01 17:15:03,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:15:03,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-01 17:15:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:03,980 INFO L225 Difference]: With dead ends: 45 [2019-01-01 17:15:03,980 INFO L226 Difference]: Without dead ends: 45 [2019-01-01 17:15:03,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:15:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-01 17:15:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-01 17:15:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 17:15:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-01 17:15:03,985 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 23 [2019-01-01 17:15:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:03,985 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-01 17:15:03,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:15:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-01 17:15:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:15:03,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:03,988 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-01 17:15:03,988 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1554357335, now seen corresponding path program 1 times [2019-01-01 17:15:03,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:03,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:03,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:03,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:03,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:04,093 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-01 17:15:04,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:15:04,093 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-01 17:15:04,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:04,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:15:04,534 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 5 treesize of output 1 [2019-01-01 17:15:04,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:04,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:04,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-01 17:15:05,125 WARN L860 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_realloc_ptr.base| Int) (|#Ultimate.C_realloc_#res.base| Int)) (and (< |c_#StackHeapBarrier| |#Ultimate.C_realloc_#res.base|) (= |c_#valid| (store (store |c_old(#valid)| |#Ultimate.C_realloc_ptr.base| 0) |#Ultimate.C_realloc_#res.base| 1)))) is different from true [2019-01-01 17:15:06,620 WARN L181 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 17:15:07,644 WARN L181 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 17:15:07,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:15:07,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:15:07,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-01 17:15:07,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:15:07,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2019-01-01 17:15:07,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:15:07,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:15:07,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-01 17:15:07,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:38 [2019-01-01 17:15:07,985 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-01 17:15:08,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:15:08,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 12 [2019-01-01 17:15:08,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 17:15:08,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 17:15:08,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=4, NotChecked=20, Total=156 [2019-01-01 17:15:08,017 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 13 states. [2019-01-01 17:15:14,444 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 17:15:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:26,327 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-01 17:15:26,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:15:26,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-01-01 17:15:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:26,329 INFO L225 Difference]: With dead ends: 58 [2019-01-01 17:15:26,329 INFO L226 Difference]: Without dead ends: 58 [2019-01-01 17:15:26,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=59, Invalid=206, Unknown=11, NotChecked=30, Total=306 [2019-01-01 17:15:26,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-01 17:15:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2019-01-01 17:15:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 17:15:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-01-01 17:15:26,338 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 27 [2019-01-01 17:15:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:26,338 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-01-01 17:15:26,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 17:15:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-01-01 17:15:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 17:15:26,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:26,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:15:26,342 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash 940437124, now seen corresponding path program 1 times [2019-01-01 17:15:26,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:26,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:26,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:26,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:26,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:26,495 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-01 17:15:26,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:15:26,495 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-01 17:15:26,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:26,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:15:26,603 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-01 17:15:26,613 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-01 17:15:26,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:26,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:26,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:26,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-01 17:15:26,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 17:15:26,657 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 11 treesize of output 3 [2019-01-01 17:15:26,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:26,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:26,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:26,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-01 17:15:26,669 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-01 17:15:26,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:15:26,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2019-01-01 17:15:26,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:15:26,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:15:26,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:15:26,698 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 11 states. [2019-01-01 17:15:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:27,043 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-01-01 17:15:27,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:15:27,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-01-01 17:15:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:27,044 INFO L225 Difference]: With dead ends: 43 [2019-01-01 17:15:27,045 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 17:15:27,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:15:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 17:15:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-01 17:15:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 17:15:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-01-01 17:15:27,049 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 28 [2019-01-01 17:15:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:27,050 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-01-01 17:15:27,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:15:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-01-01 17:15:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 17:15:27,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:27,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:15:27,054 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:27,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:27,055 INFO L82 PathProgramCache]: Analyzing trace with hash -911220169, now seen corresponding path program 1 times [2019-01-01 17:15:27,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:27,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:27,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:27,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:27,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:27,327 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-01 17:15:27,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:15:27,328 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-01 17:15:27,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:27,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:15:27,454 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-01 17:15:27,468 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-01 17:15:27,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:27,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:27,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:27,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-01 17:15:27,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-01 17:15:27,525 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-01 17:15:27,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:27,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:27,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:27,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-01-01 17:15:27,530 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-01 17:15:27,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:15:27,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2019-01-01 17:15:27,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:15:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:15:27,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:15:27,550 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 11 states. [2019-01-01 17:15:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:27,832 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-01 17:15:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:15:27,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-01-01 17:15:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:27,835 INFO L225 Difference]: With dead ends: 42 [2019-01-01 17:15:27,835 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 17:15:27,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:15:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 17:15:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-01 17:15:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 17:15:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-01-01 17:15:27,840 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 29 [2019-01-01 17:15:27,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:27,841 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-01-01 17:15:27,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:15:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-01-01 17:15:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 17:15:27,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:27,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:15:27,844 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1816945894, now seen corresponding path program 1 times [2019-01-01 17:15:27,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:27,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:27,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:27,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:27,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:27,991 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-01 17:15:27,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:15:27,992 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-01 17:15:28,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:28,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:15:28,296 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-01 17:15:28,298 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-01 17:15:28,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:28,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:28,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:28,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-01 17:15:28,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-01 17:15:28,330 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 13 treesize of output 5 [2019-01-01 17:15:28,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:28,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:28,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:28,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-01-01 17:15:28,337 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-01 17:15:28,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:15:28,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-01-01 17:15:28,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:15:28,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:15:28,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:15:28,357 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 11 states. [2019-01-01 17:15:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:28,734 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-01-01 17:15:28,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:15:28,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-01-01 17:15:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:28,737 INFO L225 Difference]: With dead ends: 41 [2019-01-01 17:15:28,737 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 17:15:28,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:15:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 17:15:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-01 17:15:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 17:15:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-01-01 17:15:28,742 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 30 [2019-01-01 17:15:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:28,742 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-01-01 17:15:28,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:15:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-01-01 17:15:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 17:15:28,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:28,746 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:15:28,746 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:28,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1392750719, now seen corresponding path program 1 times [2019-01-01 17:15:28,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:28,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:28,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:28,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:28,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 17:15:29,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:15:29,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:15:29,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:29,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:15:29,131 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-01 17:15:29,143 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 17:15:29,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-01-01 17:15:29,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-01-01 17:15:29,169 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 12 treesize of output 4 [2019-01-01 17:15:29,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-01-01 17:15:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 17:15:29,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:15:29,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 17:15:29,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:15:29,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:15:29,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:15:29,219 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 9 states. [2019-01-01 17:15:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:29,331 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-01-01 17:15:29,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:15:29,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-01-01 17:15:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:29,334 INFO L225 Difference]: With dead ends: 41 [2019-01-01 17:15:29,334 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 17:15:29,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:15:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 17:15:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-01 17:15:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 17:15:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-01 17:15:29,338 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 31 [2019-01-01 17:15:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:29,338 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-01 17:15:29,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:15:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-01 17:15:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 17:15:29,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:29,340 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:15:29,343 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:29,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2014712896, now seen corresponding path program 1 times [2019-01-01 17:15:29,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:29,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:29,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:29,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:15:29,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:15:29,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:15:29,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:29,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:15:29,847 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-01 17:15:29,850 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-01 17:15:29,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-01-01 17:15:29,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-01 17:15:29,899 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 13 treesize of output 5 [2019-01-01 17:15:29,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:29,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2019-01-01 17:15:29,964 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 5 treesize of output 1 [2019-01-01 17:15:29,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:30,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:30,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-01 17:15:30,512 WARN L860 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_realloc_#res.base| Int)) (and (< |c_#StackHeapBarrier| |#Ultimate.C_realloc_#res.base|) (= |c_#valid| (store (store |c_old(#valid)| |c_#Ultimate.C_realloc_ptr.base| 0) |#Ultimate.C_realloc_#res.base| 1)))) is different from true [2019-01-01 17:15:30,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:15:30,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:15:30,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-01 17:15:30,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:15:30,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2019-01-01 17:15:30,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:15:30,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:15:30,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-01 17:15:30,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:43 [2019-01-01 17:15:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-01-01 17:15:30,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:15:30,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2019-01-01 17:15:30,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-01 17:15:30,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 17:15:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=261, Unknown=1, NotChecked=32, Total=342 [2019-01-01 17:15:30,726 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 19 states. [2019-01-01 17:15:31,367 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 17:15:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:31,854 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-01-01 17:15:31,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 17:15:31,856 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-01-01 17:15:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:31,856 INFO L225 Difference]: With dead ends: 44 [2019-01-01 17:15:31,857 INFO L226 Difference]: Without dead ends: 44 [2019-01-01 17:15:31,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=159, Invalid=714, Unknown=1, NotChecked=56, Total=930 [2019-01-01 17:15:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-01 17:15:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2019-01-01 17:15:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:15:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-01 17:15:31,861 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 31 [2019-01-01 17:15:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:31,861 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-01 17:15:31,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-01 17:15:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-01 17:15:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 17:15:31,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:31,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:15:31,865 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:31,866 INFO L82 PathProgramCache]: Analyzing trace with hash 490747930, now seen corresponding path program 1 times [2019-01-01 17:15:31,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:31,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:31,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:31,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:31,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:32,553 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-01 17:15:32,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:15:32,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:15:32,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:32,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:15:32,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:15:32,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-01 17:15:32,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:32,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-01 17:15:32,720 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-01 17:15:32,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:32,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:32,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:32,726 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-01-01 17:15:32,904 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-01 17:15:32,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01 17:15:32,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:32,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:32,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:32,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:41 [2019-01-01 17:15:32,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2019-01-01 17:15:32,980 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2019-01-01 17:15:32,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:15:33,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:15:33,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:15:33,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:62 [2019-01-01 17:15:33,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-01 17:15:33,115 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 40 treesize of output 29 [2019-01-01 17:15:33,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:33,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:33,139 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-01 17:15:33,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:47 [2019-01-01 17:15:37,917 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-01 17:15:37,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:15:37,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2019-01-01 17:15:37,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 17:15:37,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 17:15:37,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=396, Unknown=3, NotChecked=0, Total=462 [2019-01-01 17:15:37,937 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 22 states. [2019-01-01 17:15:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:38,782 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-01-01 17:15:38,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 17:15:38,783 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-01-01 17:15:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:38,784 INFO L225 Difference]: With dead ends: 50 [2019-01-01 17:15:38,784 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 17:15:38,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=102, Invalid=597, Unknown=3, NotChecked=0, Total=702 [2019-01-01 17:15:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 17:15:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-01 17:15:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 17:15:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-01 17:15:38,789 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 31 [2019-01-01 17:15:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:38,789 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-01 17:15:38,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 17:15:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-01 17:15:38,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 17:15:38,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:15:38,792 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:15:38,792 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:15:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:15:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash -419622911, now seen corresponding path program 2 times [2019-01-01 17:15:38,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:15:38,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:15:38,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:38,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:15:38,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:15:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:15:39,399 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 17:15:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 17:15:39,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:15:39,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:15:39,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:15:39,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:15:39,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:15:39,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:15:39,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-01 17:15:39,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:39,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-01-01 17:15:39,882 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-01-01 17:15:39,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:39,885 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:39,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:39,899 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2019-01-01 17:15:40,090 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-01 17:15:40,094 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-01 17:15:40,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:45 [2019-01-01 17:15:40,154 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2019-01-01 17:15:40,158 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 35 treesize of output 26 [2019-01-01 17:15:40,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:37 [2019-01-01 17:15:40,375 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-01 17:15:40,382 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-01 17:15:40,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:39 [2019-01-01 17:15:40,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2019-01-01 17:15:40,435 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2019-01-01 17:15:40,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:15:40,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:15:40,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:15:40,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:51 [2019-01-01 17:15:40,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2019-01-01 17:15:40,486 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 27 treesize of output 18 [2019-01-01 17:15:40,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:15:40,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:26 [2019-01-01 17:15:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 17:15:41,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:15:41,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2019-01-01 17:15:41,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-01 17:15:41,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 17:15:41,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=524, Unknown=2, NotChecked=0, Total=600 [2019-01-01 17:15:41,954 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 25 states. [2019-01-01 17:15:44,489 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-01 17:15:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:15:47,550 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-01-01 17:15:47,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 17:15:47,551 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2019-01-01 17:15:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:15:47,552 INFO L225 Difference]: With dead ends: 38 [2019-01-01 17:15:47,552 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:15:47,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=138, Invalid=852, Unknown=2, NotChecked=0, Total=992 [2019-01-01 17:15:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:15:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:15:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:15:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:15:47,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-01-01 17:15:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:15:47,554 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:15:47,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-01 17:15:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:15:47,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:15:47,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:15:47 BoogieIcfgContainer [2019-01-01 17:15:47,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:15:47,560 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:15:47,560 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:15:47,560 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:15:47,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:57" (3/4) ... [2019-01-01 17:15:47,565 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:15:47,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:15:47,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_realloc [2019-01-01 17:15:47,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:15:47,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:15:47,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure expandArray [2019-01-01 17:15:47,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:15:47,578 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-01-01 17:15:47,579 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-01 17:15:47,579 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 17:15:47,579 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 17:15:47,643 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:15:47,645 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:15:47,647 INFO L168 Benchmark]: Toolchain (without parser) took 51781.87 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -219.2 MB). Peak memory consumption was 85.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:15:47,648 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:15:47,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:15:47,648 INFO L168 Benchmark]: Boogie Preprocessor took 83.78 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:15:47,649 INFO L168 Benchmark]: RCFGBuilder took 734.99 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.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:15:47,649 INFO L168 Benchmark]: TraceAbstraction took 50166.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -105.2 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:15:47,650 INFO L168 Benchmark]: Witness Printer took 85.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:15:47,655 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 705.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.78 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 734.99 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.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50166.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -105.2 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * Witness Printer took 85.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 570]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: 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: 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 - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 53 locations, 14 error locations. SAFE Result, 50.0s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 30.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 666 SDtfs, 520 SDslu, 2122 SDs, 0 SdLazy, 2259 SolverSat, 136 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 23.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 223 SyntacticMatches, 18 SemanticMatches, 214 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 22.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=6, 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, 21 MinimizatonAttempts, 48 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 699 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 670 ConstructedInterpolants, 25 QuantifiedInterpolants, 172042 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1861 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 35/74 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...