./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-simple/sll2n_remove_all_reverse_true-unreach-call_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 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 20:33:39,863 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 20:33:39,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 20:33:39,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 20:33:39,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 20:33:39,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 20:33:39,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 20:33:39,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 20:33:39,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 20:33:39,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 20:33:39,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 20:33:39,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 20:33:39,901 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 20:33:39,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 20:33:39,908 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 20:33:39,909 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 20:33:39,910 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 20:33:39,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 20:33:39,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 20:33:39,922 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 20:33:39,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 20:33:39,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 20:33:39,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 20:33:39,932 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 20:33:39,932 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 20:33:39,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 20:33:39,934 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 20:33:39,937 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 20:33:39,939 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 20:33:39,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 20:33:39,943 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 20:33:39,943 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 20:33:39,944 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 20:33:39,944 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 20:33:39,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 20:33:39,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 20:33:39,949 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 20:33:39,977 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 20:33:39,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 20:33:39,980 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 20:33:39,980 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 20:33:39,980 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 20:33:39,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 20:33:39,982 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 20:33:39,982 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 20:33:39,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 20:33:39,983 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 20:33:39,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 20:33:39,983 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 20:33:39,983 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 20:33:39,983 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 20:33:39,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 20:33:39,984 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 20:33:39,986 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 20:33:39,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 20:33:39,987 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 20:33:39,987 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 20:33:39,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:33:39,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 20:33:39,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 20:33:39,988 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 20:33:39,988 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 20:33:39,988 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 -> 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 [2019-01-14 20:33:40,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 20:33:40,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 20:33:40,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 20:33:40,062 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 20:33:40,063 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 20:33:40,063 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 20:33:40,131 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3fdb91e/af0d94a2d39d48ff95e3cf5905bac858/FLAGd25239877 [2019-01-14 20:33:40,610 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 20:33:40,610 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 20:33:40,625 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3fdb91e/af0d94a2d39d48ff95e3cf5905bac858/FLAGd25239877 [2019-01-14 20:33:40,890 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3fdb91e/af0d94a2d39d48ff95e3cf5905bac858 [2019-01-14 20:33:40,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 20:33:40,894 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 20:33:40,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 20:33:40,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 20:33:40,899 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 20:33:40,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:33:40" (1/1) ... [2019-01-14 20:33:40,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403861a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:33:40, skipping insertion in model container [2019-01-14 20:33:40,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:33:40" (1/1) ... [2019-01-14 20:33:40,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 20:33:40,959 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 20:33:41,326 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:33:41,349 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 20:33:41,482 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:33:41,549 INFO L195 MainTranslator]: Completed translation [2019-01-14 20:33:41,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:33:41 WrapperNode [2019-01-14 20:33:41,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 20:33:41,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 20:33:41,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 20:33:41,551 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 20:33:41,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:33:41" (1/1) ... [2019-01-14 20:33:41,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:33:41" (1/1) ... [2019-01-14 20:33:41,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:33:41" (1/1) ... [2019-01-14 20:33:41,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:33:41" (1/1) ... [2019-01-14 20:33:41,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:33:41" (1/1) ... [2019-01-14 20:33:41,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:33:41" (1/1) ... [2019-01-14 20:33:41,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:33:41" (1/1) ... [2019-01-14 20:33:41,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 20:33:41,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 20:33:41,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 20:33:41,666 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 20:33:41,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:33:41" (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-14 20:33:41,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 20:33:41,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 20:33:41,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 20:33:41,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 20:33:41,745 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 20:33:41,745 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-14 20:33:41,745 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-01-14 20:33:41,746 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_last [2019-01-14 20:33:41,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 20:33:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 20:33:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 20:33:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 20:33:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 20:33:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 20:33:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 20:33:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 20:33:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 20:33:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 20:33:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 20:33:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 20:33:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 20:33:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 20:33:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 20:33:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 20:33:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 20:33:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 20:33:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 20:33:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 20:33:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 20:33:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 20:33:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 20:33:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 20:33:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 20:33:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 20:33:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 20:33:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 20:33:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 20:33:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 20:33:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 20:33:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 20:33:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 20:33:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 20:33:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 20:33:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 20:33:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 20:33:41,757 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 20:33:41,758 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 20:33:41,758 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 20:33:41,758 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 20:33:41,758 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 20:33:41,758 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 20:33:41,759 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 20:33:41,759 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 20:33:41,759 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 20:33:41,760 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 20:33:41,760 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 20:33:41,760 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 20:33:41,760 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 20:33:41,760 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 20:33:41,760 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 20:33:41,760 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 20:33:41,761 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 20:33:41,761 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 20:33:41,761 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 20:33:41,761 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 20:33:41,762 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 20:33:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 20:33:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 20:33:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 20:33:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 20:33:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 20:33:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 20:33:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 20:33:41,764 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 20:33:41,764 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 20:33:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 20:33:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 20:33:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 20:33:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 20:33:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 20:33:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 20:33:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 20:33:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 20:33:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 20:33:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 20:33:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 20:33:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 20:33:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 20:33:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 20:33:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 20:33:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 20:33:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 20:33:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 20:33:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 20:33:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 20:33:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 20:33:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 20:33:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 20:33:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 20:33:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 20:33:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 20:33:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 20:33:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 20:33:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 20:33:41,773 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 20:33:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 20:33:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 20:33:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 20:33:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 20:33:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 20:33:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 20:33:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 20:33:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 20:33:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 20:33:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 20:33:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 20:33:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-14 20:33:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 20:33:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 20:33:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 20:33:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-01-14 20:33:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_last [2019-01-14 20:33:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 20:33:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 20:33:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 20:33:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 20:33:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 20:33:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 20:33:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 20:33:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 20:33:42,166 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 20:33:42,775 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 20:33:42,776 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-14 20:33:42,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:33:42 BoogieIcfgContainer [2019-01-14 20:33:42,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 20:33:42,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 20:33:42,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 20:33:42,783 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 20:33:42,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 08:33:40" (1/3) ... [2019-01-14 20:33:42,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b0bc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:33:42, skipping insertion in model container [2019-01-14 20:33:42,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:33:41" (2/3) ... [2019-01-14 20:33:42,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b0bc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:33:42, skipping insertion in model container [2019-01-14 20:33:42,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:33:42" (3/3) ... [2019-01-14 20:33:42,788 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 20:33:42,799 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 20:33:42,808 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-01-14 20:33:42,826 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-01-14 20:33:42,854 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 20:33:42,855 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 20:33:42,855 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 20:33:42,856 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 20:33:42,856 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 20:33:42,856 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 20:33:42,857 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 20:33:42,857 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 20:33:42,857 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 20:33:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-01-14 20:33:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 20:33:42,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:33:42,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:33:42,894 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:33:42,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:33:42,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2025219408, now seen corresponding path program 1 times [2019-01-14 20:33:42,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:33:42,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:33:42,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:42,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:33:42,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:33:43,137 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-14 20:33:43,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:33:43,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:33:43,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:33:43,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:33:43,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:33:43,157 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2019-01-14 20:33:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:33:43,402 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2019-01-14 20:33:43,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:33:43,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 20:33:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:33:43,414 INFO L225 Difference]: With dead ends: 88 [2019-01-14 20:33:43,414 INFO L226 Difference]: Without dead ends: 81 [2019-01-14 20:33:43,416 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-14 20:33:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-14 20:33:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-14 20:33:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 20:33:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-01-14 20:33:43,459 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 13 [2019-01-14 20:33:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:33:43,460 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-01-14 20:33:43,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:33:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-01-14 20:33:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 20:33:43,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:33:43,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:33:43,462 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:33:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:33:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2025219409, now seen corresponding path program 1 times [2019-01-14 20:33:43,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:33:43,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:33:43,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:43,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:33:43,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:33:43,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-14 20:33:43,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:33:43,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:33:43,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:33:43,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:33:43,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:33:43,570 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 3 states. [2019-01-14 20:33:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:33:43,839 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-14 20:33:43,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:33:43,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 20:33:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:33:43,845 INFO L225 Difference]: With dead ends: 79 [2019-01-14 20:33:43,845 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 20:33:43,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:33:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 20:33:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-14 20:33:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 20:33:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-01-14 20:33:43,872 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 13 [2019-01-14 20:33:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:33:43,872 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-01-14 20:33:43,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:33:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-01-14 20:33:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 20:33:43,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:33:43,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:33:43,875 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:33:43,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:33:43,875 INFO L82 PathProgramCache]: Analyzing trace with hash -39903579, now seen corresponding path program 1 times [2019-01-14 20:33:43,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:33:43,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:33:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:43,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:33:43,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:33:44,054 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-14 20:33:44,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:33:44,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 20:33:44,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 20:33:44,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 20:33:44,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 20:33:44,057 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 4 states. [2019-01-14 20:33:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:33:44,106 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-01-14 20:33:44,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 20:33:44,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-14 20:33:44,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:33:44,111 INFO L225 Difference]: With dead ends: 82 [2019-01-14 20:33:44,111 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 20:33:44,112 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-14 20:33:44,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 20:33:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-01-14 20:33:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 20:33:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-01-14 20:33:44,125 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 15 [2019-01-14 20:33:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:33:44,125 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-01-14 20:33:44,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 20:33:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-01-14 20:33:44,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 20:33:44,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:33:44,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:33:44,127 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:33:44,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:33:44,128 INFO L82 PathProgramCache]: Analyzing trace with hash 307504148, now seen corresponding path program 1 times [2019-01-14 20:33:44,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:33:44,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:33:44,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:44,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:33:44,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:33:44,283 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-14 20:33:44,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:33:44,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:33:44,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:33:44,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:33:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:33:44,285 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2019-01-14 20:33:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:33:44,727 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2019-01-14 20:33:44,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:33:44,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-14 20:33:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:33:44,731 INFO L225 Difference]: With dead ends: 123 [2019-01-14 20:33:44,731 INFO L226 Difference]: Without dead ends: 123 [2019-01-14 20:33:44,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:33:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-14 20:33:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2019-01-14 20:33:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-14 20:33:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2019-01-14 20:33:44,743 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 17 [2019-01-14 20:33:44,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:33:44,744 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2019-01-14 20:33:44,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:33:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2019-01-14 20:33:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 20:33:44,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:33:44,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:33:44,746 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:33:44,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:33:44,747 INFO L82 PathProgramCache]: Analyzing trace with hash 307504149, now seen corresponding path program 1 times [2019-01-14 20:33:44,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:33:44,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:33:44,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:44,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:33:44,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:33:44,852 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-14 20:33:44,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:33:44,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:33:44,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:33:44,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:33:44,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:33:44,853 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 5 states. [2019-01-14 20:33:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:33:44,904 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-01-14 20:33:44,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:33:44,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-14 20:33:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:33:44,907 INFO L225 Difference]: With dead ends: 89 [2019-01-14 20:33:44,907 INFO L226 Difference]: Without dead ends: 86 [2019-01-14 20:33:44,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:33:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-14 20:33:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2019-01-14 20:33:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 20:33:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-01-14 20:33:44,914 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 17 [2019-01-14 20:33:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:33:44,915 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-01-14 20:33:44,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:33:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-01-14 20:33:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 20:33:44,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:33:44,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:33:44,916 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:33:44,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:33:44,917 INFO L82 PathProgramCache]: Analyzing trace with hash 123258323, now seen corresponding path program 1 times [2019-01-14 20:33:44,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:33:44,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:33:44,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:44,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:33:44,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:33:45,029 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-14 20:33:45,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:33:45,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:33:45,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:33:45,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:33:45,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:33:45,030 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 6 states. [2019-01-14 20:33:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:33:45,311 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-01-14 20:33:45,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:33:45,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 20:33:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:33:45,314 INFO L225 Difference]: With dead ends: 79 [2019-01-14 20:33:45,314 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 20:33:45,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:33:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 20:33:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-01-14 20:33:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 20:33:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-01-14 20:33:45,322 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 19 [2019-01-14 20:33:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:33:45,322 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-01-14 20:33:45,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:33:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-01-14 20:33:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 20:33:45,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:33:45,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:33:45,324 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:33:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:33:45,324 INFO L82 PathProgramCache]: Analyzing trace with hash 123258324, now seen corresponding path program 1 times [2019-01-14 20:33:45,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:33:45,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:33:45,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:45,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:33:45,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:33:45,591 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-14 20:33:45,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:33:45,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:33:45,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:33:45,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:33:45,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:33:45,594 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2019-01-14 20:33:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:33:46,052 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-01-14 20:33:46,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:33:46,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 20:33:46,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:33:46,055 INFO L225 Difference]: With dead ends: 78 [2019-01-14 20:33:46,056 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 20:33:46,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:33:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 20:33:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-14 20:33:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 20:33:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-01-14 20:33:46,065 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 19 [2019-01-14 20:33:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:33:46,065 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-01-14 20:33:46,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:33:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-01-14 20:33:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 20:33:46,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:33:46,067 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-14 20:33:46,068 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:33:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:33:46,068 INFO L82 PathProgramCache]: Analyzing trace with hash -616890411, now seen corresponding path program 1 times [2019-01-14 20:33:46,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:33:46,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:33:46,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:46,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:33:46,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:33:46,180 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-14 20:33:46,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:33:46,180 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-14 20:33:46,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:33:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:33:46,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:33:46,300 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-14 20:33:46,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:33:46,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 20:33:46,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:33:46,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:33:46,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:33:46,324 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 6 states. [2019-01-14 20:33:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:33:46,404 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-01-14 20:33:46,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:33:46,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-14 20:33:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:33:46,408 INFO L225 Difference]: With dead ends: 91 [2019-01-14 20:33:46,408 INFO L226 Difference]: Without dead ends: 88 [2019-01-14 20:33:46,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:33:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-14 20:33:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-01-14 20:33:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-14 20:33:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-01-14 20:33:46,416 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 30 [2019-01-14 20:33:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:33:46,416 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-01-14 20:33:46,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:33:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-01-14 20:33:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 20:33:46,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:33:46,419 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:33:46,421 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:33:46,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:33:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1002767796, now seen corresponding path program 2 times [2019-01-14 20:33:46,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:33:46,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:33:46,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:46,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:33:46,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:33:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:33:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:33:47,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:33:47,295 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-14 20:33:47,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:33:47,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:33:47,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:33:47,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:33:47,424 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 6 treesize of output 5 [2019-01-14 20:33:47,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:33:47,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:33:47,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 20:33:47,468 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-14 20:33:47,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:33:47,476 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-14 20:33:47,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 20:33:47,831 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) |c_#valid|) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-14 20:33:48,309 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (< |c_#StackHeapBarrier| v_prenex_1) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |c_#valid|))) is different from true [2019-01-14 20:33:48,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:33:48,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-14 20:33:48,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:33:48,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-14 20:33:48,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:33:48,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:33:48,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:33:48,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-01-14 20:33:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2019-01-14 20:33:48,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:33:48,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-01-14 20:33:48,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 20:33:48,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 20:33:48,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=171, Unknown=2, NotChecked=54, Total=272 [2019-01-14 20:33:48,560 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 17 states. [2019-01-14 20:33:49,915 WARN L181 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-14 20:33:51,089 WARN L181 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2019-01-14 20:33:56,438 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2019-01-14 20:34:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:00,437 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-01-14 20:34:00,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 20:34:00,438 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-01-14 20:34:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:00,441 INFO L225 Difference]: With dead ends: 133 [2019-01-14 20:34:00,441 INFO L226 Difference]: Without dead ends: 133 [2019-01-14 20:34:00,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=105, Invalid=388, Unknown=21, NotChecked=86, Total=600 [2019-01-14 20:34:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-14 20:34:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2019-01-14 20:34:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 20:34:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-01-14 20:34:00,450 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 43 [2019-01-14 20:34:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:00,452 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-01-14 20:34:00,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 20:34:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-01-14 20:34:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 20:34:00,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:00,454 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:00,455 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:00,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:00,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1002767797, now seen corresponding path program 1 times [2019-01-14 20:34:00,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:00,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:00,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:00,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:34:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 20:34:01,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:01,007 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-14 20:34:01,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:01,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:01,099 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 6 treesize of output 5 [2019-01-14 20:34:01,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:01,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:01,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 20:34:01,270 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-14 20:34:01,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:01,336 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-14 20:34:01,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 20:34:01,687 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |c_old(#length)| |node_create_#t~malloc2.base| 8) |c_#length|) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-14 20:34:02,227 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 20:34:02,677 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int) (sll_create_~new_head~0.base Int)) (and (= (store (store |c_old(#length)| |node_create_#t~malloc2.base| 8) sll_create_~new_head~0.base 8) |c_#length|) (< |c_#StackHeapBarrier| sll_create_~new_head~0.base) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-14 20:34:02,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:34:02,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:34:02,745 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-14 20:34:02,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:34:02,809 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 0 case distinctions, treesize of input 23 treesize of output 30 [2019-01-14 20:34:02,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:02,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:02,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:34:02,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-01-14 20:34:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 14 not checked. [2019-01-14 20:34:03,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:34:03,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2019-01-14 20:34:03,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 20:34:03,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 20:34:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2019-01-14 20:34:03,165 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 17 states. [2019-01-14 20:34:05,005 WARN L181 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-01-14 20:34:08,984 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-01-14 20:34:10,931 WARN L181 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2019-01-14 20:34:15,667 WARN L181 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2019-01-14 20:34:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:18,834 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2019-01-14 20:34:18,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 20:34:18,835 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-01-14 20:34:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:18,838 INFO L225 Difference]: With dead ends: 141 [2019-01-14 20:34:18,838 INFO L226 Difference]: Without dead ends: 141 [2019-01-14 20:34:18,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=98, Invalid=395, Unknown=21, NotChecked=86, Total=600 [2019-01-14 20:34:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-14 20:34:18,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2019-01-14 20:34:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-14 20:34:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2019-01-14 20:34:18,849 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 43 [2019-01-14 20:34:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:18,849 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2019-01-14 20:34:18,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 20:34:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2019-01-14 20:34:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 20:34:18,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:18,853 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:18,853 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:18,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:18,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1021030653, now seen corresponding path program 1 times [2019-01-14 20:34:18,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:18,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:18,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:18,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:18,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 20:34:19,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:19,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 20:34:19,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:34:19,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:34:19,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:34:19,547 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 13 states. [2019-01-14 20:34:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:20,089 INFO L93 Difference]: Finished difference Result 165 states and 207 transitions. [2019-01-14 20:34:20,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 20:34:20,090 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-01-14 20:34:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:20,092 INFO L225 Difference]: With dead ends: 165 [2019-01-14 20:34:20,092 INFO L226 Difference]: Without dead ends: 165 [2019-01-14 20:34:20,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-01-14 20:34:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-14 20:34:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 127. [2019-01-14 20:34:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-14 20:34:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 159 transitions. [2019-01-14 20:34:20,100 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 159 transitions. Word has length 44 [2019-01-14 20:34:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:20,101 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 159 transitions. [2019-01-14 20:34:20,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:34:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2019-01-14 20:34:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 20:34:20,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:20,102 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:20,103 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1021030654, now seen corresponding path program 1 times [2019-01-14 20:34:20,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:20,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:20,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:34:20,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:20,508 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-14 20:34:20,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:20,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:21,066 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 23 treesize of output 19 [2019-01-14 20:34:21,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 20:34:21,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:21,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:21,081 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 28 treesize of output 22 [2019-01-14 20:34:21,104 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 22 treesize of output 13 [2019-01-14 20:34:21,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:21,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:21,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:21,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:13 [2019-01-14 20:34:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 20:34:21,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:34:21,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2019-01-14 20:34:21,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 20:34:21,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 20:34:21,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-01-14 20:34:21,190 INFO L87 Difference]: Start difference. First operand 127 states and 159 transitions. Second operand 29 states. [2019-01-14 20:34:21,883 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-01-14 20:34:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:22,852 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2019-01-14 20:34:22,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 20:34:22,854 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2019-01-14 20:34:22,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:22,856 INFO L225 Difference]: With dead ends: 168 [2019-01-14 20:34:22,856 INFO L226 Difference]: Without dead ends: 168 [2019-01-14 20:34:22,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 20:34:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-14 20:34:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 127. [2019-01-14 20:34:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-14 20:34:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2019-01-14 20:34:22,863 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 44 [2019-01-14 20:34:22,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:22,864 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2019-01-14 20:34:22,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 20:34:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2019-01-14 20:34:22,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 20:34:22,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:22,865 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:22,866 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:22,866 INFO L82 PathProgramCache]: Analyzing trace with hash 565846907, now seen corresponding path program 1 times [2019-01-14 20:34:22,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:22,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:22,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:22,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:22,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:34:23,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:23,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 20:34:23,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:34:23,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:34:23,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:34:23,152 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand 13 states. [2019-01-14 20:34:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:23,504 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2019-01-14 20:34:23,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 20:34:23,505 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-01-14 20:34:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:23,506 INFO L225 Difference]: With dead ends: 126 [2019-01-14 20:34:23,507 INFO L226 Difference]: Without dead ends: 126 [2019-01-14 20:34:23,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-01-14 20:34:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-14 20:34:23,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-01-14 20:34:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 20:34:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2019-01-14 20:34:23,512 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 47 [2019-01-14 20:34:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:23,513 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2019-01-14 20:34:23,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:34:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2019-01-14 20:34:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 20:34:23,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:23,514 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:23,515 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:23,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash 361816003, now seen corresponding path program 1 times [2019-01-14 20:34:23,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:23,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:23,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 20:34:23,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:23,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:34:23,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:34:23,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:34:23,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:34:23,785 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand 6 states. [2019-01-14 20:34:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:23,948 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2019-01-14 20:34:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:34:23,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-01-14 20:34:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:23,952 INFO L225 Difference]: With dead ends: 127 [2019-01-14 20:34:23,952 INFO L226 Difference]: Without dead ends: 127 [2019-01-14 20:34:23,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:34:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-14 20:34:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-01-14 20:34:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 20:34:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2019-01-14 20:34:23,958 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 48 [2019-01-14 20:34:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:23,958 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2019-01-14 20:34:23,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:34:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2019-01-14 20:34:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 20:34:23,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:23,960 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:23,960 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash 361816004, now seen corresponding path program 1 times [2019-01-14 20:34:23,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:23,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:23,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:23,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:23,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:34:24,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:24,422 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-14 20:34:24,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:24,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:24,612 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 23 treesize of output 19 [2019-01-14 20:34:24,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 20:34:24,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:24,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:24,630 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 28 treesize of output 22 [2019-01-14 20:34:24,632 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 22 treesize of output 13 [2019-01-14 20:34:24,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:24,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:24,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:24,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2019-01-14 20:34:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 20:34:24,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:34:24,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2019-01-14 20:34:24,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 20:34:24,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 20:34:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-01-14 20:34:24,714 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand 24 states. [2019-01-14 20:34:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:25,959 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2019-01-14 20:34:25,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 20:34:25,961 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-01-14 20:34:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:25,962 INFO L225 Difference]: With dead ends: 182 [2019-01-14 20:34:25,962 INFO L226 Difference]: Without dead ends: 182 [2019-01-14 20:34:25,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2019-01-14 20:34:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-14 20:34:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 125. [2019-01-14 20:34:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-14 20:34:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2019-01-14 20:34:25,970 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 48 [2019-01-14 20:34:25,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:25,970 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2019-01-14 20:34:25,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 20:34:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2019-01-14 20:34:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 20:34:25,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:25,971 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:25,972 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash 361385054, now seen corresponding path program 1 times [2019-01-14 20:34:25,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:25,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:25,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:25,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:34:26,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:26,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 20:34:26,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:34:26,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:34:26,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:34:26,238 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand 13 states. [2019-01-14 20:34:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:26,954 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2019-01-14 20:34:26,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 20:34:26,956 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-01-14 20:34:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:26,958 INFO L225 Difference]: With dead ends: 164 [2019-01-14 20:34:26,958 INFO L226 Difference]: Without dead ends: 164 [2019-01-14 20:34:26,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-01-14 20:34:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-14 20:34:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 133. [2019-01-14 20:34:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-14 20:34:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2019-01-14 20:34:26,964 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 48 [2019-01-14 20:34:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:26,965 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2019-01-14 20:34:26,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:34:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2019-01-14 20:34:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 20:34:26,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:26,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:26,966 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:26,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1681965091, now seen corresponding path program 1 times [2019-01-14 20:34:26,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:26,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:26,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:26,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:26,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 20:34:27,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:27,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 20:34:27,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:34:27,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:34:27,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:34:27,218 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand 5 states. [2019-01-14 20:34:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:27,719 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2019-01-14 20:34:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:34:27,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-14 20:34:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:27,722 INFO L225 Difference]: With dead ends: 132 [2019-01-14 20:34:27,722 INFO L226 Difference]: Without dead ends: 132 [2019-01-14 20:34:27,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:34:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-14 20:34:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-01-14 20:34:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-14 20:34:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2019-01-14 20:34:27,727 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 49 [2019-01-14 20:34:27,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:27,728 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2019-01-14 20:34:27,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:34:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2019-01-14 20:34:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 20:34:27,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:27,729 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:27,729 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash -187169459, now seen corresponding path program 1 times [2019-01-14 20:34:27,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:27,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:27,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:27,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:27,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:34:28,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:28,688 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-14 20:34:28,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:28,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:28,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 13 treesize of output 10 [2019-01-14 20:34:28,907 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 10 treesize of output 9 [2019-01-14 20:34:28,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:28,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:28,918 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 13 treesize of output 10 [2019-01-14 20:34:28,922 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 10 treesize of output 9 [2019-01-14 20:34:28,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:28,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:28,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:28,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2019-01-14 20:34:29,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2019-01-14 20:34:29,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:34:29,388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-01-14 20:34:29,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:29,421 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 39 treesize of output 30 [2019-01-14 20:34:29,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:29,511 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 30 treesize of output 23 [2019-01-14 20:34:29,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:29,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:34:29,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 20:34:29,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:59 [2019-01-14 20:34:29,823 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2019-01-14 20:34:29,826 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 28 treesize of output 17 [2019-01-14 20:34:29,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:29,845 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 17 treesize of output 15 [2019-01-14 20:34:29,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:29,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:29,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2019-01-14 20:34:29,939 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 16 treesize of output 4 [2019-01-14 20:34:29,940 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:29,959 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-14 20:34:29,960 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:29,962 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:29,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:29,967 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:71, output treesize:4 [2019-01-14 20:34:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:34:30,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:34:30,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 38 [2019-01-14 20:34:30,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 20:34:30,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 20:34:30,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1321, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 20:34:30,010 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand 38 states. [2019-01-14 20:34:34,529 WARN L181 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-14 20:34:37,843 WARN L181 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-14 20:34:38,029 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-01-14 20:34:38,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:38,489 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2019-01-14 20:34:38,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 20:34:38,490 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 50 [2019-01-14 20:34:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:38,492 INFO L225 Difference]: With dead ends: 155 [2019-01-14 20:34:38,492 INFO L226 Difference]: Without dead ends: 155 [2019-01-14 20:34:38,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=274, Invalid=3032, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 20:34:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-14 20:34:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2019-01-14 20:34:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-14 20:34:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2019-01-14 20:34:38,505 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 50 [2019-01-14 20:34:38,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:38,506 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2019-01-14 20:34:38,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 20:34:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2019-01-14 20:34:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 20:34:38,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:38,507 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:38,508 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:38,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:38,508 INFO L82 PathProgramCache]: Analyzing trace with hash 518831993, now seen corresponding path program 1 times [2019-01-14 20:34:38,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:38,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:38,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:38,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:38,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:34:39,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:39,323 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-14 20:34:39,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:39,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:39,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 20:34:39,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:39,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:39,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-14 20:34:39,672 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 13 treesize of output 10 [2019-01-14 20:34:39,680 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 10 treesize of output 9 [2019-01-14 20:34:39,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:39,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:39,690 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-14 20:34:39,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-01-14 20:34:40,162 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 27 treesize of output 23 [2019-01-14 20:34:40,166 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 23 treesize of output 15 [2019-01-14 20:34:40,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:40,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:40,179 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-14 20:34:40,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2019-01-14 20:34:40,293 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2019-01-14 20:34:40,298 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 30 treesize of output 26 [2019-01-14 20:34:40,299 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-14 20:34:40,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2019-01-14 20:34:40,320 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:40,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2019-01-14 20:34:40,346 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:34:40,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:40,354 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-14 20:34:40,355 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-01-14 20:34:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:34:40,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:34:40,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 37 [2019-01-14 20:34:40,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 20:34:40,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 20:34:40,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1319, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 20:34:40,383 INFO L87 Difference]: Start difference. First operand 134 states and 160 transitions. Second operand 38 states. [2019-01-14 20:34:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:43,057 INFO L93 Difference]: Finished difference Result 158 states and 188 transitions. [2019-01-14 20:34:43,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-14 20:34:43,059 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 52 [2019-01-14 20:34:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:43,061 INFO L225 Difference]: With dead ends: 158 [2019-01-14 20:34:43,061 INFO L226 Difference]: Without dead ends: 158 [2019-01-14 20:34:43,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=251, Invalid=2829, Unknown=0, NotChecked=0, Total=3080 [2019-01-14 20:34:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-14 20:34:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2019-01-14 20:34:43,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-14 20:34:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2019-01-14 20:34:43,074 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 52 [2019-01-14 20:34:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:43,074 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2019-01-14 20:34:43,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 20:34:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2019-01-14 20:34:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 20:34:43,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:43,075 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:43,079 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash 518831994, now seen corresponding path program 1 times [2019-01-14 20:34:43,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:43,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:43,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:43,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:43,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:34:43,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:43,941 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-14 20:34:43,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:44,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:44,045 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 6 treesize of output 5 [2019-01-14 20:34:44,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:44,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:44,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 20:34:44,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 20:34:44,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:44,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:44,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-14 20:34:44,425 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 13 treesize of output 10 [2019-01-14 20:34:44,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 20:34:44,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:44,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:44,450 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 13 treesize of output 10 [2019-01-14 20:34:44,453 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 10 treesize of output 9 [2019-01-14 20:34:44,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:44,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:44,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:44,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-01-14 20:34:45,026 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2019-01-14 20:34:45,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2019-01-14 20:34:45,042 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:34:45,081 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 68 treesize of output 60 [2019-01-14 20:34:45,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:34:45,122 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 60 treesize of output 41 [2019-01-14 20:34:45,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:45,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 20:34:45,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2019-01-14 20:34:45,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2019-01-14 20:34:45,197 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:45,212 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:45,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2019-01-14 20:34:45,227 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 41 treesize of output 35 [2019-01-14 20:34:45,227 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:34:45,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:34:45,264 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-01-14 20:34:45,265 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:45,285 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:45,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2019-01-14 20:34:45,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:34:45,360 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2019-01-14 20:34:45,361 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:45,503 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:45,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:45,522 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:80, output treesize:9 [2019-01-14 20:34:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:34:45,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:34:45,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2019-01-14 20:34:45,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-14 20:34:45,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-14 20:34:45,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1968, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 20:34:45,649 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand 46 states. [2019-01-14 20:34:47,779 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-01-14 20:34:48,243 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-01-14 20:34:48,435 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-01-14 20:34:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:49,851 INFO L93 Difference]: Finished difference Result 178 states and 212 transitions. [2019-01-14 20:34:49,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-14 20:34:49,852 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2019-01-14 20:34:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:49,854 INFO L225 Difference]: With dead ends: 178 [2019-01-14 20:34:49,855 INFO L226 Difference]: Without dead ends: 178 [2019-01-14 20:34:49,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=290, Invalid=3742, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 20:34:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-14 20:34:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2019-01-14 20:34:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-14 20:34:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 188 transitions. [2019-01-14 20:34:49,862 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 188 transitions. Word has length 52 [2019-01-14 20:34:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:49,864 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 188 transitions. [2019-01-14 20:34:49,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-14 20:34:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 188 transitions. [2019-01-14 20:34:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 20:34:49,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:49,867 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:49,867 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash 381341571, now seen corresponding path program 1 times [2019-01-14 20:34:49,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:49,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:49,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:49,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:49,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 20:34:50,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:50,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:34:50,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:50,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:50,304 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-14 20:34:50,307 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-14 20:34:50,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:50,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:50,313 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-14 20:34:50,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-14 20:34:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 20:34:50,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:34:50,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 20:34:50,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:34:50,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:34:50,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:34:50,356 INFO L87 Difference]: Start difference. First operand 154 states and 188 transitions. Second operand 7 states. [2019-01-14 20:34:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:50,706 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2019-01-14 20:34:50,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 20:34:50,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-14 20:34:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:50,714 INFO L225 Difference]: With dead ends: 159 [2019-01-14 20:34:50,714 INFO L226 Difference]: Without dead ends: 159 [2019-01-14 20:34:50,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:34:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-14 20:34:50,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-01-14 20:34:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-14 20:34:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 194 transitions. [2019-01-14 20:34:50,729 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 194 transitions. Word has length 54 [2019-01-14 20:34:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:50,730 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 194 transitions. [2019-01-14 20:34:50,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:34:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 194 transitions. [2019-01-14 20:34:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 20:34:50,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:50,731 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:50,738 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:50,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:50,738 INFO L82 PathProgramCache]: Analyzing trace with hash 381341572, now seen corresponding path program 1 times [2019-01-14 20:34:50,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:50,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:50,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:50,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:50,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:34:51,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:51,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:34:51,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:51,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:51,445 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 23 treesize of output 19 [2019-01-14 20:34:51,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 20:34:51,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:51,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:51,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-14 20:34:51,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-14 20:34:51,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:51,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:51,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:51,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2019-01-14 20:34:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 20:34:51,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:34:51,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 26 [2019-01-14 20:34:51,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-14 20:34:51,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-14 20:34:51,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-01-14 20:34:51,599 INFO L87 Difference]: Start difference. First operand 158 states and 194 transitions. Second operand 27 states. [2019-01-14 20:34:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:53,318 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2019-01-14 20:34:53,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 20:34:53,322 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2019-01-14 20:34:53,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:53,324 INFO L225 Difference]: With dead ends: 178 [2019-01-14 20:34:53,324 INFO L226 Difference]: Without dead ends: 178 [2019-01-14 20:34:53,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=272, Invalid=2278, Unknown=0, NotChecked=0, Total=2550 [2019-01-14 20:34:53,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-14 20:34:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 162. [2019-01-14 20:34:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-14 20:34:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2019-01-14 20:34:53,332 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 54 [2019-01-14 20:34:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:53,332 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2019-01-14 20:34:53,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-14 20:34:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2019-01-14 20:34:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 20:34:53,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:53,337 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:53,337 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1600273867, now seen corresponding path program 3 times [2019-01-14 20:34:53,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:53,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:53,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 20:34:53,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:53,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:34:53,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 20:34:53,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 20:34:53,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:34:53,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 20:34:53,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:34:53,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 20:34:53,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:34:53,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:34:53,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:34:53,588 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand 7 states. [2019-01-14 20:34:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:53,673 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2019-01-14 20:34:53,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:34:53,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-01-14 20:34:53,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:53,676 INFO L225 Difference]: With dead ends: 106 [2019-01-14 20:34:53,676 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 20:34:53,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:34:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 20:34:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-14 20:34:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 20:34:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2019-01-14 20:34:53,680 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 56 [2019-01-14 20:34:53,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:53,681 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2019-01-14 20:34:53,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:34:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2019-01-14 20:34:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 20:34:53,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:53,684 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:53,684 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:53,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:53,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1397032643, now seen corresponding path program 1 times [2019-01-14 20:34:53,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:53,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:53,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:53,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:34:53,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:34:54,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:54,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:34:54,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:54,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:54,456 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 13 treesize of output 10 [2019-01-14 20:34:54,459 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 10 treesize of output 9 [2019-01-14 20:34:54,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:54,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:54,474 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-14 20:34:54,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-14 20:34:54,680 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 27 treesize of output 23 [2019-01-14 20:34:54,683 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 23 treesize of output 15 [2019-01-14 20:34:54,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:54,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:54,693 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-14 20:34:54,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2019-01-14 20:34:54,789 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2019-01-14 20:34:54,800 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 17 treesize of output 9 [2019-01-14 20:34:54,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:54,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:54,811 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-14 20:34:54,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2019-01-14 20:34:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:34:54,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:34:54,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 31 [2019-01-14 20:34:54,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 20:34:54,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 20:34:54,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=924, Unknown=0, NotChecked=0, Total=992 [2019-01-14 20:34:54,838 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 32 states. [2019-01-14 20:34:56,144 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-01-14 20:34:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:57,881 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-01-14 20:34:57,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 20:34:57,882 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2019-01-14 20:34:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:57,883 INFO L225 Difference]: With dead ends: 106 [2019-01-14 20:34:57,883 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 20:34:57,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=2062, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 20:34:57,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 20:34:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-01-14 20:34:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 20:34:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-01-14 20:34:57,888 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 56 [2019-01-14 20:34:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:57,888 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-01-14 20:34:57,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 20:34:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-01-14 20:34:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 20:34:57,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:57,889 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:57,893 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:57,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:57,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1397085231, now seen corresponding path program 2 times [2019-01-14 20:34:57,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:57,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:57,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:57,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:57,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:58,402 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 20:34:59,298 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-01-14 20:34:59,770 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-14 20:35:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:35:00,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:35:00,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:35:00,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:35:00,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:35:00,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:35:00,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:35:00,520 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 13 treesize of output 10 [2019-01-14 20:35:00,522 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 10 treesize of output 9 [2019-01-14 20:35:00,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:00,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:00,537 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 13 treesize of output 10 [2019-01-14 20:35:00,540 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 10 treesize of output 9 [2019-01-14 20:35:00,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:00,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:00,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:00,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-01-14 20:35:11,097 WARN L181 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 20:35:15,249 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 20:35:15,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:15,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:15,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 20:35:15,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:15,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 20:35:15,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-14 20:35:15,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:15,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 20:35:15,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:15,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:15,336 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:15,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 20:35:15,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-14 20:35:15,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:15,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 20:35:15,373 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:15,377 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:15,384 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:15,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:35:15,398 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:68, output treesize:40 [2019-01-14 20:35:15,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-14 20:35:15,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2019-01-14 20:35:15,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 20:35:15,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:35:15,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-14 20:35:15,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-01-14 20:35:15,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:15,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:15,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:35:15,924 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:111 [2019-01-14 20:35:17,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 130 [2019-01-14 20:35:17,304 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:17,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2019-01-14 20:35:17,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:17,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 63 [2019-01-14 20:35:17,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:35:17,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 116 treesize of output 106 [2019-01-14 20:35:17,502 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:35:17,585 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 104 treesize of output 80 [2019-01-14 20:35:17,586 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:35:17,665 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:17,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2019-01-14 20:35:17,666 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:17,747 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:17,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 102 [2019-01-14 20:35:17,764 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 20:35:17,873 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:17,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2019-01-14 20:35:17,879 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:35:18,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 87 treesize of output 55 [2019-01-14 20:35:18,381 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:35:18,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2019-01-14 20:35:18,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2019-01-14 20:35:18,588 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 43 treesize of output 26 [2019-01-14 20:35:18,588 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2019-01-14 20:35:18,646 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,691 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 39 treesize of output 22 [2019-01-14 20:35:18,692 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,718 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 22 treesize of output 15 [2019-01-14 20:35:18,719 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,734 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 57 [2019-01-14 20:35:18,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:18,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2019-01-14 20:35:18,755 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,792 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:18,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2019-01-14 20:35:18,794 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2019-01-14 20:35:18,829 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,858 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 27 treesize of output 25 [2019-01-14 20:35:18,859 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,886 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 22 treesize of output 15 [2019-01-14 20:35:18,887 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,903 INFO L267 ElimStorePlain]: Start of recursive call 16: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 [2019-01-14 20:35:18,925 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 51 treesize of output 34 [2019-01-14 20:35:18,926 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:18,996 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 34 treesize of output 32 [2019-01-14 20:35:18,997 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2019-01-14 20:35:19,064 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,156 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:19,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:19,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2019-01-14 20:35:19,167 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,233 INFO L267 ElimStorePlain]: Start of recursive call 22: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 67 [2019-01-14 20:35:19,271 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:19,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-01-14 20:35:19,272 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-01-14 20:35:19,383 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,582 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 51 treesize of output 34 [2019-01-14 20:35:19,582 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,631 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:19,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:19,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2019-01-14 20:35:19,637 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,675 INFO L267 ElimStorePlain]: Start of recursive call 27: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2019-01-14 20:35:19,686 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:19,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-14 20:35:19,687 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-01-14 20:35:19,707 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:35:19,722 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 7 treesize of output 1 [2019-01-14 20:35:19,723 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,733 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:19,777 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 3 variables, input treesize:156, output treesize:7 [2019-01-14 20:35:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:35:19,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:35:19,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 50 [2019-01-14 20:35:19,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-14 20:35:19,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-14 20:35:19,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2310, Unknown=24, NotChecked=0, Total=2450 [2019-01-14 20:35:19,883 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 50 states. [2019-01-14 20:35:38,964 WARN L181 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-01-14 20:35:47,407 WARN L181 SmtUtils]: Spent 8.21 s on a formula simplification. DAG size of input: 93 DAG size of output: 57 [2019-01-14 20:35:48,759 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-01-14 20:35:49,597 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-01-14 20:35:49,954 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 74 [2019-01-14 20:35:50,278 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-01-14 20:35:50,708 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2019-01-14 20:35:51,569 WARN L181 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2019-01-14 20:35:51,863 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-01-14 20:35:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:52,662 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-01-14 20:35:52,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 20:35:52,664 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 56 [2019-01-14 20:35:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:52,665 INFO L225 Difference]: With dead ends: 97 [2019-01-14 20:35:52,665 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 20:35:52,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=288, Invalid=4794, Unknown=30, NotChecked=0, Total=5112 [2019-01-14 20:35:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 20:35:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-01-14 20:35:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 20:35:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-01-14 20:35:52,673 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 56 [2019-01-14 20:35:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:52,673 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-01-14 20:35:52,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-14 20:35:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-01-14 20:35:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 20:35:52,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:52,679 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:35:52,679 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:52,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:52,679 INFO L82 PathProgramCache]: Analyzing trace with hash -695544581, now seen corresponding path program 1 times [2019-01-14 20:35:52,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:52,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:52,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:52,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:35:52,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 20:35:52,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:35:52,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:35:52,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:52,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:35:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 20:35:52,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:35:52,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 20:35:52,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:35:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:35:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:35:52,916 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 5 states. [2019-01-14 20:35:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:52,953 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-01-14 20:35:52,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:35:52,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-01-14 20:35:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:52,957 INFO L225 Difference]: With dead ends: 97 [2019-01-14 20:35:52,957 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 20:35:52,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:35:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 20:35:52,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-14 20:35:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 20:35:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-01-14 20:35:52,961 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 62 [2019-01-14 20:35:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:52,961 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-01-14 20:35:52,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:35:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-01-14 20:35:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 20:35:52,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:52,965 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:35:52,965 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:52,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:52,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1596693738, now seen corresponding path program 1 times [2019-01-14 20:35:52,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:52,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:52,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:52,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:52,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 20:35:53,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:35:53,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:35:53,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:53,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:35:53,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:53,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 20:35:53,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-14 20:35:53,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:35:53,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:24 [2019-01-14 20:35:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 20:35:53,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:35:53,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-01-14 20:35:53,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 20:35:53,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 20:35:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-01-14 20:35:53,529 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 16 states. [2019-01-14 20:35:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:54,964 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2019-01-14 20:35:54,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 20:35:54,966 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2019-01-14 20:35:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:54,967 INFO L225 Difference]: With dead ends: 132 [2019-01-14 20:35:54,967 INFO L226 Difference]: Without dead ends: 132 [2019-01-14 20:35:54,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-01-14 20:35:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-14 20:35:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2019-01-14 20:35:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 20:35:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-01-14 20:35:54,971 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 64 [2019-01-14 20:35:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:54,971 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-01-14 20:35:54,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 20:35:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-01-14 20:35:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 20:35:54,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:54,976 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:35:54,977 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:54,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:54,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2042101625, now seen corresponding path program 1 times [2019-01-14 20:35:54,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:54,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:54,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:54,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:54,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:35:56,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:35:56,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:35:56,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:56,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:35:56,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:56,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:56,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 20:35:56,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:56,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:56,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 20:35:56,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 20:35:56,470 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 10 treesize of output 9 [2019-01-14 20:35:56,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:56,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:56,479 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-14 20:35:56,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-01-14 20:35:58,284 WARN L181 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 20:35:58,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:58,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 51 [2019-01-14 20:35:58,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-14 20:35:58,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 20:35:58,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:113 [2019-01-14 20:35:59,643 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 20:35:59,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:59,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2019-01-14 20:35:59,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 56 [2019-01-14 20:35:59,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:35:59,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:35:59,746 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 46 [2019-01-14 20:35:59,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2019-01-14 20:35:59,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:59,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:59,762 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 51 treesize of output 49 [2019-01-14 20:35:59,767 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 17 treesize of output 15 [2019-01-14 20:35:59,767 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:35:59,782 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:35:59,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-14 20:35:59,813 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:91 [2019-01-14 20:36:00,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:00,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-14 20:36:00,178 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 7 treesize of output 1 [2019-01-14 20:36:00,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:00,187 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 20 treesize of output 11 [2019-01-14 20:36:00,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:00,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:00,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:36:00,202 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:11 [2019-01-14 20:36:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:36:00,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:36:00,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 53 [2019-01-14 20:36:00,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-14 20:36:00,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-14 20:36:00,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2711, Unknown=1, NotChecked=0, Total=2862 [2019-01-14 20:36:00,294 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 54 states. [2019-01-14 20:36:06,623 WARN L181 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 20:36:08,186 WARN L181 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 20:36:09,885 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2019-01-14 20:36:17,418 WARN L181 SmtUtils]: Spent 701.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 20:36:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:36:19,656 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2019-01-14 20:36:19,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 20:36:19,658 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 65 [2019-01-14 20:36:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:36:19,662 INFO L225 Difference]: With dead ends: 150 [2019-01-14 20:36:19,662 INFO L226 Difference]: Without dead ends: 150 [2019-01-14 20:36:19,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=569, Invalid=7435, Unknown=6, NotChecked=0, Total=8010 [2019-01-14 20:36:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-14 20:36:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2019-01-14 20:36:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 20:36:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2019-01-14 20:36:19,669 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 65 [2019-01-14 20:36:19,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:36:19,670 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2019-01-14 20:36:19,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-14 20:36:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2019-01-14 20:36:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 20:36:19,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:36:19,674 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:36:19,674 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:36:19,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:36:19,675 INFO L82 PathProgramCache]: Analyzing trace with hash -2042101624, now seen corresponding path program 1 times [2019-01-14 20:36:19,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:36:19,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:36:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:19,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:36:20,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:36:20,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:36:20,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:20,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:36:21,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 60 [2019-01-14 20:36:21,518 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 47 treesize of output 46 [2019-01-14 20:36:21,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:21,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 54 [2019-01-14 20:36:21,601 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 20:36:21,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:36:21,665 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 2 xjuncts. [2019-01-14 20:36:21,666 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:107 [2019-01-14 20:36:21,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:21,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2019-01-14 20:36:21,788 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 14 treesize of output 13 [2019-01-14 20:36:21,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:21,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:21,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:36:21,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:131, output treesize:63 [2019-01-14 20:36:22,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:22,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2019-01-14 20:36:22,079 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 43 treesize of output 30 [2019-01-14 20:36:22,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:22,094 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 7 treesize of output 1 [2019-01-14 20:36:22,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:22,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:22,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:22,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2019-01-14 20:36:22,133 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 7 treesize of output 1 [2019-01-14 20:36:22,133 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:22,145 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 22 treesize of output 13 [2019-01-14 20:36:22,146 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:22,152 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:22,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:22,159 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:74, output treesize:13 [2019-01-14 20:36:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:36:22,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:36:22,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 45 [2019-01-14 20:36:22,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-14 20:36:22,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-14 20:36:22,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1947, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 20:36:22,240 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 46 states. [2019-01-14 20:36:25,689 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 43 [2019-01-14 20:36:25,994 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 45 [2019-01-14 20:36:32,246 WARN L181 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-01-14 20:36:34,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:36:34,752 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2019-01-14 20:36:34,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-14 20:36:34,754 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 65 [2019-01-14 20:36:34,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:36:34,757 INFO L225 Difference]: With dead ends: 158 [2019-01-14 20:36:34,757 INFO L226 Difference]: Without dead ends: 158 [2019-01-14 20:36:34,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=568, Invalid=5912, Unknown=0, NotChecked=0, Total=6480 [2019-01-14 20:36:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-14 20:36:34,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 130. [2019-01-14 20:36:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-14 20:36:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2019-01-14 20:36:34,772 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 65 [2019-01-14 20:36:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:36:34,773 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2019-01-14 20:36:34,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-14 20:36:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2019-01-14 20:36:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-14 20:36:34,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:36:34,778 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:36:34,779 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:36:34,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:36:34,779 INFO L82 PathProgramCache]: Analyzing trace with hash 701482728, now seen corresponding path program 1 times [2019-01-14 20:36:34,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:36:34,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:36:34,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:34,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:34,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:36:35,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:36:35,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:36:35,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:35,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:36:35,360 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 9 treesize of output 7 [2019-01-14 20:36:35,362 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 7 treesize of output 5 [2019-01-14 20:36:35,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:35,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:35,370 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-14 20:36:35,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:3 [2019-01-14 20:36:36,218 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_remove_last_~snd_to_last~0.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_remove_last_#in~head.base|) |c_sll_remove_last_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) (+ sll_remove_last_~snd_to_last~0.offset 4) 0))))) is different from true [2019-01-14 20:36:36,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:36,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2019-01-14 20:36:36,232 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 14 treesize of output 13 [2019-01-14 20:36:36,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:36,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:36,249 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-14 20:36:36,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-01-14 20:36:36,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:36,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 20:36:36,371 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 19 treesize of output 13 [2019-01-14 20:36:36,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 20:36:36,387 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 7 treesize of output 1 [2019-01-14 20:36:36,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:36,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:36,397 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-14 20:36:36,398 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2019-01-14 20:36:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:36:36,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:36:36,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2019-01-14 20:36:36,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 20:36:36,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 20:36:36,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=676, Unknown=1, NotChecked=52, Total=812 [2019-01-14 20:36:36,429 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand 29 states. [2019-01-14 20:36:46,986 WARN L181 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-01-14 20:36:55,987 WARN L181 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-14 20:37:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:37:00,492 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2019-01-14 20:37:00,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-14 20:37:00,493 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2019-01-14 20:37:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:37:00,495 INFO L225 Difference]: With dead ends: 157 [2019-01-14 20:37:00,495 INFO L226 Difference]: Without dead ends: 157 [2019-01-14 20:37:00,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=345, Invalid=2593, Unknown=36, NotChecked=106, Total=3080 [2019-01-14 20:37:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-14 20:37:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2019-01-14 20:37:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-14 20:37:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-01-14 20:37:00,506 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 69 [2019-01-14 20:37:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:37:00,509 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-01-14 20:37:00,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 20:37:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-01-14 20:37:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 20:37:00,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:37:00,510 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:37:00,510 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:37:00,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:37:00,511 INFO L82 PathProgramCache]: Analyzing trace with hash 229180759, now seen corresponding path program 1 times [2019-01-14 20:37:00,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:37:00,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:37:00,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:00,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:00,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:37:01,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:37:01,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:37:01,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:01,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:37:02,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 42 [2019-01-14 20:37:02,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-14 20:37:02,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:02,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2019-01-14 20:37:02,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 20:37:02,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:37:02,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:37:02,331 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:25, output treesize:37 [2019-01-14 20:37:02,387 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 20:37:02,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:02,396 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 27 treesize of output 23 [2019-01-14 20:37:02,399 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 23 treesize of output 19 [2019-01-14 20:37:02,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:02,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:02,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:02,416 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:22 [2019-01-14 20:37:03,147 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 70 [2019-01-14 20:37:03,152 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 63 treesize of output 59 [2019-01-14 20:37:03,152 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-14 20:37:03,194 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2019-01-14 20:37:03,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:37:03,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 40 [2019-01-14 20:37:03,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 20:37:03,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:03,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:03,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:03,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 77 [2019-01-14 20:37:03,368 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 73 treesize of output 65 [2019-01-14 20:37:03,369 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:03,414 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 57 treesize of output 50 [2019-01-14 20:37:03,415 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,450 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 57 treesize of output 48 [2019-01-14 20:37:03,451 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,484 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 50 treesize of output 39 [2019-01-14 20:37:03,484 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,520 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2019-01-14 20:37:03,521 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:37:03,560 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 20:37:03,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2019-01-14 20:37:03,655 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 7 treesize of output 1 [2019-01-14 20:37:03,656 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2019-01-14 20:37:03,667 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,696 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2019-01-14 20:37:03,708 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 28 [2019-01-14 20:37:03,709 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 28 treesize of output 24 [2019-01-14 20:37:03,738 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,757 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2019-01-14 20:37:03,776 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2019-01-14 20:37:03,777 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2019-01-14 20:37:03,805 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 29 treesize of output 22 [2019-01-14 20:37:03,806 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 18 [2019-01-14 20:37:03,833 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,845 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:03,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2019-01-14 20:37:03,923 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 48 treesize of output 39 [2019-01-14 20:37:03,924 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:03,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:03,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-01-14 20:37:04,000 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:04,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 20:37:04,061 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,116 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 35 treesize of output 31 [2019-01-14 20:37:04,117 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:04,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-14 20:37:04,176 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,233 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 25 [2019-01-14 20:37:04,234 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:04,287 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-14 20:37:04,288 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,356 INFO L267 ElimStorePlain]: Start of recursive call 22: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:37:04,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:04,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2019-01-14 20:37:04,375 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 31 [2019-01-14 20:37:04,375 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,409 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-14 20:37:04,410 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,437 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 32 treesize of output 28 [2019-01-14 20:37:04,438 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:04,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 28 treesize of output 17 [2019-01-14 20:37:04,487 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,508 INFO L267 ElimStorePlain]: Start of recursive call 30: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:37:04,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:04,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 48 [2019-01-14 20:37:04,531 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 31 [2019-01-14 20:37:04,531 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,594 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-14 20:37:04,595 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-01-14 20:37:04,696 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:04,752 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-14 20:37:04,752 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-01-14 20:37:04,798 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,851 INFO L267 ElimStorePlain]: Start of recursive call 35: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:37:04,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:37:04,901 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 8 variables, input treesize:143, output treesize:17 [2019-01-14 20:37:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:37:04,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:37:04,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2019-01-14 20:37:04,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-14 20:37:04,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-14 20:37:04,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=2229, Unknown=0, NotChecked=0, Total=2352 [2019-01-14 20:37:04,961 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 49 states. [2019-01-14 20:37:11,469 WARN L181 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2019-01-14 20:37:11,969 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 52 [2019-01-14 20:37:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:37:13,483 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2019-01-14 20:37:13,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 20:37:13,484 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 71 [2019-01-14 20:37:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:37:13,485 INFO L225 Difference]: With dead ends: 136 [2019-01-14 20:37:13,485 INFO L226 Difference]: Without dead ends: 136 [2019-01-14 20:37:13,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=593, Invalid=6209, Unknown=4, NotChecked=0, Total=6806 [2019-01-14 20:37:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-14 20:37:13,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2019-01-14 20:37:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-14 20:37:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2019-01-14 20:37:13,491 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 71 [2019-01-14 20:37:13,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:37:13,491 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-01-14 20:37:13,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-14 20:37:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2019-01-14 20:37:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 20:37:13,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:37:13,492 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:37:13,495 INFO L423 AbstractCegarLoop]: === Iteration 32 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:37:13,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:37:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash -184959925, now seen corresponding path program 1 times [2019-01-14 20:37:13,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:37:13,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:37:13,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:13,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 20:37:13,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:37:13,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 20:37:13,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 20:37:13,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 20:37:13,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:37:13,829 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand 9 states. [2019-01-14 20:37:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:37:13,979 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2019-01-14 20:37:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:37:13,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-01-14 20:37:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:37:13,983 INFO L225 Difference]: With dead ends: 131 [2019-01-14 20:37:13,983 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 20:37:13,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:37:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 20:37:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2019-01-14 20:37:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 20:37:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-01-14 20:37:13,991 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 71 [2019-01-14 20:37:13,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:37:13,995 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-01-14 20:37:13,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 20:37:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-01-14 20:37:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 20:37:13,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:37:13,998 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:37:13,998 INFO L423 AbstractCegarLoop]: === Iteration 33 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:37:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:37:14,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1199432963, now seen corresponding path program 1 times [2019-01-14 20:37:14,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:37:14,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:37:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:14,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:37:15,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:37:15,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:37:15,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:15,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:37:15,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 65 [2019-01-14 20:37:15,707 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 52 treesize of output 51 [2019-01-14 20:37:15,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:15,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 60 [2019-01-14 20:37:15,752 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 20:37:15,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:37:15,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:37:15,797 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:51, output treesize:82 [2019-01-14 20:37:15,875 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 20:37:15,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:15,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:15,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2019-01-14 20:37:15,900 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 18 treesize of output 17 [2019-01-14 20:37:15,900 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:15,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:15,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:15,922 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:106, output treesize:47 [2019-01-14 20:37:16,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:16,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 71 [2019-01-14 20:37:16,221 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 23 treesize of output 3 [2019-01-14 20:37:16,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:16,233 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 38 treesize of output 32 [2019-01-14 20:37:16,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:16,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:16,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:16,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-01-14 20:37:16,291 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 19 treesize of output 15 [2019-01-14 20:37:16,291 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:16,298 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 15 treesize of output 3 [2019-01-14 20:37:16,299 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:16,302 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:16,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:16,307 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:78, output treesize:7 [2019-01-14 20:37:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:37:16,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:37:16,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2019-01-14 20:37:16,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-14 20:37:16,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-14 20:37:16,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1780, Unknown=4, NotChecked=0, Total=1892 [2019-01-14 20:37:16,380 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 44 states. [2019-01-14 20:37:19,130 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2019-01-14 20:37:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:37:19,368 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2019-01-14 20:37:19,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-14 20:37:19,371 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 73 [2019-01-14 20:37:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:37:19,372 INFO L225 Difference]: With dead ends: 119 [2019-01-14 20:37:19,373 INFO L226 Difference]: Without dead ends: 115 [2019-01-14 20:37:19,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=297, Invalid=3605, Unknown=4, NotChecked=0, Total=3906 [2019-01-14 20:37:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-14 20:37:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-01-14 20:37:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 20:37:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-01-14 20:37:19,379 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 73 [2019-01-14 20:37:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:37:19,379 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-01-14 20:37:19,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-14 20:37:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-01-14 20:37:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 20:37:19,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:37:19,380 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:37:19,380 INFO L423 AbstractCegarLoop]: === Iteration 34 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:37:19,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:37:19,381 INFO L82 PathProgramCache]: Analyzing trace with hash -696354863, now seen corresponding path program 1 times [2019-01-14 20:37:19,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:37:19,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:37:19,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:19,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:19,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:19,750 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-14 20:37:20,145 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 20:37:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:37:22,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:37:22,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:37:22,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:22,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:37:22,268 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-14 20:37:22,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:22,274 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-14 20:37:22,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-14 20:37:22,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:22,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2019-01-14 20:37:22,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:22,385 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-14 20:37:22,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:22,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:22,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2019-01-14 20:37:22,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:22,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:22,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:48 [2019-01-14 20:37:22,672 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 13 treesize of output 10 [2019-01-14 20:37:22,675 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 10 treesize of output 9 [2019-01-14 20:37:22,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:22,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:22,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:22,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:78 [2019-01-14 20:37:25,280 WARN L181 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 20:37:25,978 WARN L181 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 20:37:26,092 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-01-14 20:37:26,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:26,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 166 [2019-01-14 20:37:26,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:26,105 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:37:26,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 93 [2019-01-14 20:37:26,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:26,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:26,164 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 92 treesize of output 84 [2019-01-14 20:37:26,168 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 84 treesize of output 76 [2019-01-14 20:37:26,169 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:26,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:26,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:26,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 95 [2019-01-14 20:37:26,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 62 [2019-01-14 20:37:26,241 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:37:26,291 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:37:26,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-14 20:37:26,358 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:188, output treesize:191 [2019-01-14 20:37:26,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:26,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:26,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2019-01-14 20:37:26,902 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 46 treesize of output 36 [2019-01-14 20:37:26,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:26,921 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 7 treesize of output 1 [2019-01-14 20:37:26,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:26,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:26,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:26,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:184, output treesize:58 [2019-01-14 20:37:27,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:27,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:27,195 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 0 case distinctions, treesize of input 21 treesize of output 32 [2019-01-14 20:37:27,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:27,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 20:37:27,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:56 [2019-01-14 20:37:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 20:37:27,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:37:27,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 54 [2019-01-14 20:37:27,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-14 20:37:27,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-14 20:37:27,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2820, Unknown=1, NotChecked=0, Total=2970 [2019-01-14 20:37:27,563 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 55 states. [2019-01-14 20:37:29,859 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 55 [2019-01-14 20:37:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:37:37,920 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-01-14 20:37:37,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 20:37:37,923 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 78 [2019-01-14 20:37:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:37:37,924 INFO L225 Difference]: With dead ends: 127 [2019-01-14 20:37:37,925 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 20:37:37,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=286, Invalid=5114, Unknown=2, NotChecked=0, Total=5402 [2019-01-14 20:37:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 20:37:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-01-14 20:37:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 20:37:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2019-01-14 20:37:37,935 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 78 [2019-01-14 20:37:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:37:37,935 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2019-01-14 20:37:37,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-14 20:37:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2019-01-14 20:37:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 20:37:37,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:37:37,936 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:37:37,936 INFO L423 AbstractCegarLoop]: === Iteration 35 === [sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:37:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:37:37,942 INFO L82 PathProgramCache]: Analyzing trace with hash -107929965, now seen corresponding path program 1 times [2019-01-14 20:37:37,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:37:37,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:37:37,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:37,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:37,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 20:37:38,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:37:38,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 20:37:38,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:37:38,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:37:38,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:37:38,119 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 6 states. [2019-01-14 20:37:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:37:38,202 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-14 20:37:38,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:37:38,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-01-14 20:37:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:37:38,203 INFO L225 Difference]: With dead ends: 68 [2019-01-14 20:37:38,203 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 20:37:38,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:37:38,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 20:37:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 20:37:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 20:37:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 20:37:38,204 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2019-01-14 20:37:38,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:37:38,205 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 20:37:38,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:37:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 20:37:38,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 20:37:38,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 08:37:38 BoogieIcfgContainer [2019-01-14 20:37:38,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 20:37:38,211 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 20:37:38,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 20:37:38,211 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 20:37:38,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:33:42" (3/4) ... [2019-01-14 20:37:38,216 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 20:37:38,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 20:37:38,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 20:37:38,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_remove_last [2019-01-14 20:37:38,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 20:37:38,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 20:37:38,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2019-01-14 20:37:38,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 20:37:38,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-14 20:37:38,231 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-01-14 20:37:38,231 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-14 20:37:38,231 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 20:37:38,281 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 20:37:38,282 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 20:37:38,283 INFO L168 Benchmark]: Toolchain (without parser) took 237389.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.0 MB). Free memory was 951.3 MB in the beginning and 787.8 MB in the end (delta: 163.5 MB). Peak memory consumption was 412.5 MB. Max. memory is 11.5 GB. [2019-01-14 20:37:38,285 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:37:38,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -93.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-14 20:37:38,285 INFO L168 Benchmark]: Boogie Preprocessor took 114.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:37:38,286 INFO L168 Benchmark]: RCFGBuilder took 1111.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 987.8 MB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. [2019-01-14 20:37:38,286 INFO L168 Benchmark]: TraceAbstraction took 235431.93 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 987.8 MB in the beginning and 787.9 MB in the end (delta: 199.9 MB). Peak memory consumption was 375.0 MB. Max. memory is 11.5 GB. [2019-01-14 20:37:38,286 INFO L168 Benchmark]: Witness Printer took 71.41 ms. Allocated memory is still 1.3 GB. Free memory was 787.9 MB in the beginning and 787.8 MB in the end (delta: 31.0 kB). Peak memory consumption was 31.0 kB. Max. memory is 11.5 GB. [2019-01-14 20:37:38,289 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 655.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -93.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1111.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 987.8 MB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 235431.93 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 987.8 MB in the beginning and 787.9 MB in the end (delta: 199.9 MB). Peak memory consumption was 375.0 MB. Max. memory is 11.5 GB. * Witness Printer took 71.41 ms. Allocated memory is still 1.3 GB. Free memory was 787.9 MB in the beginning and 787.8 MB in the end (delta: 31.0 kB). Peak memory consumption was 31.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 596]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 97 locations, 31 error locations. SAFE Result, 235.3s OverallTime, 35 OverallIterations, 3 TraceHistogramMax, 167.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1969 SDtfs, 4356 SDslu, 18042 SDs, 0 SdLazy, 25092 SolverSat, 638 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 51.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2070 GetRequests, 984 SyntacticMatches, 43 SemanticMatches, 1043 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 9003 ImplicationChecksByTransitivity, 164.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 527 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 64.2s InterpolantComputationTime, 2869 NumberOfCodeBlocks, 2869 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 2813 ConstructedInterpolants, 158 QuantifiedInterpolants, 1831285 SizeOfPredicates, 316 NumberOfNonLiveVariables, 6456 ConjunctsInSsa, 1040 ConjunctsInUnsatCore, 56 InterpolantComputations, 16 PerfectInterpolantSequences, 601/974 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...