./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/sll2c_update_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/sll2c_update_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 db17479a00afa98e4ce70a37e790a923b748e4dc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 00:12:51,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:12:51,943 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:12:51,958 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:12:51,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:12:51,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:12:51,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:12:51,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:12:51,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:12:51,966 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:12:51,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:12:51,967 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:12:51,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:12:51,970 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:12:51,971 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:12:51,972 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:12:51,973 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:12:51,975 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:12:51,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:12:51,979 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:12:51,980 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:12:51,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:12:51,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:12:51,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:12:51,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:12:51,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:12:51,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:12:51,988 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:12:51,989 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:12:51,990 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:12:51,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:12:51,991 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:12:51,992 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:12:51,992 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:12:51,993 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:12:51,995 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:12:51,995 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:12:52,010 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:12:52,011 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:12:52,012 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:12:52,012 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:12:52,012 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:12:52,012 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:12:52,013 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:12:52,013 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:12:52,014 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:12:52,014 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:12:52,014 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:12:52,014 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:12:52,014 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:12:52,014 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:12:52,015 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:12:52,015 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:12:52,015 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:12:52,015 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:12:52,015 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:12:52,016 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:12:52,017 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:12:52,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:12:52,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:12:52,018 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:12:52,018 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:12:52,018 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:12:52,018 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 -> db17479a00afa98e4ce70a37e790a923b748e4dc [2019-01-14 00:12:52,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:12:52,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:12:52,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:12:52,092 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:12:52,092 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:12:52,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:12:52,167 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6123cb6e4/823bb48be724484984f047cc84a3c62f/FLAG70cc1a8b9 [2019-01-14 00:12:52,681 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:12:52,682 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:12:52,696 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6123cb6e4/823bb48be724484984f047cc84a3c62f/FLAG70cc1a8b9 [2019-01-14 00:12:52,962 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6123cb6e4/823bb48be724484984f047cc84a3c62f [2019-01-14 00:12:52,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:12:52,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:12:52,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:12:52,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:12:52,973 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:12:52,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:12:52" (1/1) ... [2019-01-14 00:12:52,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341a16df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:12:52, skipping insertion in model container [2019-01-14 00:12:52,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:12:52" (1/1) ... [2019-01-14 00:12:52,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:12:53,030 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:12:53,456 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:12:53,472 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:12:53,591 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:12:53,660 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:12:53,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:12:53 WrapperNode [2019-01-14 00:12:53,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:12:53,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:12:53,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:12:53,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:12:53,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:12:53" (1/1) ... [2019-01-14 00:12:53,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:12:53" (1/1) ... [2019-01-14 00:12:53,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:12:53" (1/1) ... [2019-01-14 00:12:53,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:12:53" (1/1) ... [2019-01-14 00:12:53,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:12:53" (1/1) ... [2019-01-14 00:12:53,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:12:53" (1/1) ... [2019-01-14 00:12:53,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:12:53" (1/1) ... [2019-01-14 00:12:53,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:12:53,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:12:53,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:12:53,750 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:12:53,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:12:53" (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 00:12:53,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:12:53,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:12:53,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 00:12:53,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 00:12:53,812 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 00:12:53,812 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-14 00:12:53,813 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-01-14 00:12:53,813 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-01-14 00:12:53,813 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2019-01-14 00:12:53,813 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2019-01-14 00:12:53,813 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:12:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 00:12:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 00:12:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 00:12:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 00:12:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 00:12:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 00:12:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 00:12:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 00:12:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 00:12:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 00:12:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 00:12:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 00:12:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 00:12:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 00:12:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 00:12:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 00:12:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 00:12:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 00:12:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 00:12:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 00:12:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 00:12:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 00:12:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 00:12:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 00:12:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 00:12:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 00:12:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 00:12:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 00:12:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 00:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 00:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 00:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 00:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 00:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 00:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 00:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 00:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 00:12:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 00:12:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 00:12:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 00:12:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 00:12:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 00:12:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 00:12:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 00:12:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 00:12:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 00:12:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 00:12:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 00:12:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 00:12:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 00:12:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 00:12:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 00:12:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 00:12:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 00:12:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 00:12:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 00:12:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:12:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 00:12:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:12:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 00:12:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 00:12:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 00:12:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 00:12:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 00:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 00:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 00:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 00:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 00:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 00:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 00:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 00:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 00:12:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 00:12:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 00:12:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 00:12:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 00:12:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 00:12:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 00:12:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 00:12:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 00:12:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 00:12:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 00:12:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 00:12:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 00:12:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 00:12:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 00:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 00:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 00:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 00:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 00:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 00:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 00:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 00:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 00:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 00:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 00:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 00:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 00:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 00:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 00:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 00:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 00:12:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 00:12:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 00:12:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 00:12:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 00:12:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 00:12:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-14 00:12:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 00:12:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 00:12:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:12:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-01-14 00:12:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-01-14 00:12:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 00:12:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:12:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2019-01-14 00:12:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:12:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2019-01-14 00:12:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:12:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:12:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:12:54,188 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 00:12:54,795 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:12:54,795 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 00:12:54,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:12:54 BoogieIcfgContainer [2019-01-14 00:12:54,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:12:54,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:12:54,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:12:54,804 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:12:54,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:12:52" (1/3) ... [2019-01-14 00:12:54,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a5a8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:12:54, skipping insertion in model container [2019-01-14 00:12:54,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:12:53" (2/3) ... [2019-01-14 00:12:54,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a5a8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:12:54, skipping insertion in model container [2019-01-14 00:12:54,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:12:54" (3/3) ... [2019-01-14 00:12:54,809 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:12:54,820 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:12:54,828 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2019-01-14 00:12:54,847 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2019-01-14 00:12:54,875 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:12:54,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:12:54,876 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:12:54,876 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:12:54,877 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:12:54,877 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:12:54,877 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:12:54,877 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:12:54,877 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:12:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-01-14 00:12:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:12:54,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:12:54,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:12:54,913 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:12:54,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:12:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash -154446967, now seen corresponding path program 1 times [2019-01-14 00:12:54,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:12:54,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:12:54,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:54,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:12:54,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:12:55,107 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 00:12:55,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:12:55,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:12:55,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:12:55,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:12:55,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:12:55,126 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2019-01-14 00:12:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:12:55,424 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-01-14 00:12:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:12:55,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 00:12:55,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:12:55,442 INFO L225 Difference]: With dead ends: 101 [2019-01-14 00:12:55,443 INFO L226 Difference]: Without dead ends: 94 [2019-01-14 00:12:55,445 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 00:12:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-14 00:12:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-14 00:12:55,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-14 00:12:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-01-14 00:12:55,508 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 12 [2019-01-14 00:12:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:12:55,509 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-01-14 00:12:55,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:12:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-01-14 00:12:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:12:55,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:12:55,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:12:55,511 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:12:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:12:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash -154446966, now seen corresponding path program 1 times [2019-01-14 00:12:55,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:12:55,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:12:55,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:55,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:12:55,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:12:55,625 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 00:12:55,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:12:55,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:12:55,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:12:55,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:12:55,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:12:55,632 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 3 states. [2019-01-14 00:12:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:12:55,863 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-01-14 00:12:55,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:12:55,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 00:12:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:12:55,866 INFO L225 Difference]: With dead ends: 92 [2019-01-14 00:12:55,866 INFO L226 Difference]: Without dead ends: 92 [2019-01-14 00:12:55,870 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 00:12:55,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-14 00:12:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-14 00:12:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 00:12:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-01-14 00:12:55,891 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 12 [2019-01-14 00:12:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:12:55,892 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-01-14 00:12:55,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:12:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-01-14 00:12:55,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:12:55,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:12:55,894 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 00:12:55,894 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:12:55,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:12:55,898 INFO L82 PathProgramCache]: Analyzing trace with hash -308881252, now seen corresponding path program 1 times [2019-01-14 00:12:55,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:12:55,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:12:55,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:55,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:12:55,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:12:56,153 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 00:12:56,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:12:56,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:12:56,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:12:56,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:12:56,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:12:56,156 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 6 states. [2019-01-14 00:12:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:12:56,652 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2019-01-14 00:12:56,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:12:56,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 00:12:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:12:56,657 INFO L225 Difference]: With dead ends: 96 [2019-01-14 00:12:56,657 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 00:12:56,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:12:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 00:12:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-01-14 00:12:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-14 00:12:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2019-01-14 00:12:56,672 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 19 [2019-01-14 00:12:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:12:56,673 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2019-01-14 00:12:56,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:12:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2019-01-14 00:12:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:12:56,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:12:56,674 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 00:12:56,674 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:12:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:12:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash -308881251, now seen corresponding path program 1 times [2019-01-14 00:12:56,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:12:56,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:12:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:56,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:12:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:12:56,784 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 00:12:56,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:12:56,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:12:56,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:12:56,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:12:56,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:12:56,787 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 5 states. [2019-01-14 00:12:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:12:56,844 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-01-14 00:12:56,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:12:56,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-14 00:12:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:12:56,847 INFO L225 Difference]: With dead ends: 93 [2019-01-14 00:12:56,847 INFO L226 Difference]: Without dead ends: 93 [2019-01-14 00:12:56,848 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 00:12:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-14 00:12:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-14 00:12:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 00:12:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2019-01-14 00:12:56,856 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 19 [2019-01-14 00:12:56,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:12:56,856 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2019-01-14 00:12:56,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:12:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2019-01-14 00:12:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 00:12:56,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:12:56,857 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:12:56,858 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:12:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:12:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1499366792, now seen corresponding path program 1 times [2019-01-14 00:12:56,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:12:56,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:12:56,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:56,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:12:56,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:12:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:12:56,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:12:56,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:12:56,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:12:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:12:56,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:12:56,983 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 6 states. [2019-01-14 00:12:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:12:57,298 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-01-14 00:12:57,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:12:57,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-14 00:12:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:12:57,301 INFO L225 Difference]: With dead ends: 93 [2019-01-14 00:12:57,302 INFO L226 Difference]: Without dead ends: 93 [2019-01-14 00:12:57,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 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 00:12:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-14 00:12:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-01-14 00:12:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 00:12:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-01-14 00:12:57,310 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 28 [2019-01-14 00:12:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:12:57,311 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-01-14 00:12:57,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:12:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-01-14 00:12:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 00:12:57,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:12:57,312 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:12:57,312 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:12:57,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:12:57,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1499366791, now seen corresponding path program 1 times [2019-01-14 00:12:57,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:12:57,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:12:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:57,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:12:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:12:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:12:57,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:12:57,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:12:57,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:12:57,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:12:57,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:12:57,449 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 6 states. [2019-01-14 00:12:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:12:57,786 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2019-01-14 00:12:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:12:57,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-14 00:12:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:12:57,789 INFO L225 Difference]: With dead ends: 92 [2019-01-14 00:12:57,789 INFO L226 Difference]: Without dead ends: 92 [2019-01-14 00:12:57,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 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 00:12:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-14 00:12:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-01-14 00:12:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-14 00:12:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-01-14 00:12:57,797 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 28 [2019-01-14 00:12:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:12:57,797 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-01-14 00:12:57,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:12:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-01-14 00:12:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 00:12:57,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:12:57,799 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 00:12:57,799 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:12:57,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:12:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 23894858, now seen corresponding path program 1 times [2019-01-14 00:12:57,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:12:57,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:12:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:57,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:12:57,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:12:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:12:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:12:58,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:12:58,250 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 00:12:58,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:12:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:12:58,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:12:59,781 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 00:12:59,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:12:59,788 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 1 xjuncts. [2019-01-14 00:12:59,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 00:12:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:12:59,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:12:59,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-14 00:12:59,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:12:59,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:12:59,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2019-01-14 00:12:59,829 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2019-01-14 00:13:00,628 WARN L181 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 00:13:01,053 WARN L181 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 00:13:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:01,956 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2019-01-14 00:13:01,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:13:01,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-01-14 00:13:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:01,965 INFO L225 Difference]: With dead ends: 125 [2019-01-14 00:13:01,965 INFO L226 Difference]: Without dead ends: 125 [2019-01-14 00:13:01,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2019-01-14 00:13:01,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-14 00:13:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 90. [2019-01-14 00:13:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 00:13:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2019-01-14 00:13:01,973 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 31 [2019-01-14 00:13:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:01,973 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2019-01-14 00:13:01,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:13:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2019-01-14 00:13:01,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 00:13:01,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:01,975 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 00:13:01,975 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:01,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:01,976 INFO L82 PathProgramCache]: Analyzing trace with hash 23894859, now seen corresponding path program 1 times [2019-01-14 00:13:01,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:01,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:01,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:01,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:01,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:13:02,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:13:02,485 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 00:13:02,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:02,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:13:02,574 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 00:13:02,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:02,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:02,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 00:13:03,050 WARN L860 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int)) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base 8))) is different from true [2019-01-14 00:13:03,062 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 19 treesize of output 14 [2019-01-14 00:13:03,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:03,081 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 1 xjuncts. [2019-01-14 00:13:03,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-01-14 00:13:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2019-01-14 00:13:03,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:13:03,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-01-14 00:13:03,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 00:13:03,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 00:13:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2019-01-14 00:13:03,180 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 14 states. [2019-01-14 00:13:03,942 WARN L181 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-14 00:13:04,723 WARN L181 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-01-14 00:13:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:05,399 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2019-01-14 00:13:05,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:13:05,400 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-01-14 00:13:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:05,402 INFO L225 Difference]: With dead ends: 90 [2019-01-14 00:13:05,402 INFO L226 Difference]: Without dead ends: 90 [2019-01-14 00:13:05,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=57, Invalid=218, Unknown=1, NotChecked=30, Total=306 [2019-01-14 00:13:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-14 00:13:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-01-14 00:13:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 00:13:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2019-01-14 00:13:05,408 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 31 [2019-01-14 00:13:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:05,409 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2019-01-14 00:13:05,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 00:13:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2019-01-14 00:13:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 00:13:05,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:05,410 INFO L402 BasicCegarLoop]: trace histogram [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 00:13:05,411 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:05,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:05,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1977617260, now seen corresponding path program 1 times [2019-01-14 00:13:05,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:05,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:05,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:05,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:05,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:13:05,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:13:05,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:13:05,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:13:05,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:13:05,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:13:05,596 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 12 states. [2019-01-14 00:13:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:06,149 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2019-01-14 00:13:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:13:06,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-01-14 00:13:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:06,153 INFO L225 Difference]: With dead ends: 95 [2019-01-14 00:13:06,153 INFO L226 Difference]: Without dead ends: 95 [2019-01-14 00:13:06,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:13:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-14 00:13:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-01-14 00:13:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 00:13:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-01-14 00:13:06,158 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 40 [2019-01-14 00:13:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:06,159 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-01-14 00:13:06,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:13:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-01-14 00:13:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 00:13:06,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:06,160 INFO L402 BasicCegarLoop]: trace histogram [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 00:13:06,161 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:06,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1977617261, now seen corresponding path program 1 times [2019-01-14 00:13:06,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:06,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:06,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:06,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:06,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 00:13:06,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:13:06,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 00:13:06,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:13:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:13:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:13:06,256 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 6 states. [2019-01-14 00:13:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:06,478 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2019-01-14 00:13:06,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:13:06,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-01-14 00:13:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:06,484 INFO L225 Difference]: With dead ends: 113 [2019-01-14 00:13:06,484 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 00:13:06,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:13:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 00:13:06,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2019-01-14 00:13:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 00:13:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-01-14 00:13:06,496 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 40 [2019-01-14 00:13:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:06,496 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-01-14 00:13:06,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:13:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-01-14 00:13:06,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 00:13:06,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:06,506 INFO L402 BasicCegarLoop]: trace histogram [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 00:13:06,507 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:06,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:06,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1977617316, now seen corresponding path program 1 times [2019-01-14 00:13:06,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:06,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:06,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:13:07,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:13:07,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:13:07,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:13:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:13:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:13:07,466 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 12 states. [2019-01-14 00:13:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:07,986 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2019-01-14 00:13:07,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:13:07,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-01-14 00:13:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:07,990 INFO L225 Difference]: With dead ends: 109 [2019-01-14 00:13:07,990 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 00:13:07,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:13:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 00:13:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2019-01-14 00:13:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 00:13:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2019-01-14 00:13:07,997 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 40 [2019-01-14 00:13:07,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:07,997 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2019-01-14 00:13:07,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:13:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2019-01-14 00:13:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 00:13:07,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:07,999 INFO L402 BasicCegarLoop]: trace histogram [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 00:13:07,999 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:07,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1131082394, now seen corresponding path program 1 times [2019-01-14 00:13:07,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:08,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:08,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:08,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:08,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:13:09,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:13:09,044 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 00:13:09,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:09,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:13:09,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 00:13:09,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:13:09,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:09,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:09,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:09,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-14 00:13:09,736 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 38 [2019-01-14 00:13:09,746 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 30 treesize of output 29 [2019-01-14 00:13:09,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:09,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:09,781 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 00:13:09,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2019-01-14 00:13:10,175 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 28 treesize of output 26 [2019-01-14 00:13:10,179 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:13:10,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2019-01-14 00:13:10,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:10,197 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 18 treesize of output 13 [2019-01-14 00:13:10,198 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:10,209 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 00:13:10,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:10,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:10,225 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 00:13:10,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:11 [2019-01-14 00:13:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:13:10,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:13:10,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2019-01-14 00:13:10,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 00:13:10,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 00:13:10,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1317, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 00:13:10,290 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 38 states. [2019-01-14 00:13:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:12,482 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2019-01-14 00:13:12,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 00:13:12,483 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 43 [2019-01-14 00:13:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:12,485 INFO L225 Difference]: With dead ends: 153 [2019-01-14 00:13:12,485 INFO L226 Difference]: Without dead ends: 153 [2019-01-14 00:13:12,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=203, Invalid=2553, Unknown=0, NotChecked=0, Total=2756 [2019-01-14 00:13:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-14 00:13:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2019-01-14 00:13:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-14 00:13:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2019-01-14 00:13:12,494 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 43 [2019-01-14 00:13:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:12,495 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2019-01-14 00:13:12,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 00:13:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2019-01-14 00:13:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 00:13:12,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:12,498 INFO L402 BasicCegarLoop]: trace histogram [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 00:13:12,499 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:12,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1131082395, now seen corresponding path program 1 times [2019-01-14 00:13:12,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:12,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:12,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:12,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:12,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:13:13,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:13:13,329 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 00:13:13,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:13,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:13:13,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:13:13,937 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 17 [2019-01-14 00:13:13,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:13,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:13:13,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:13:13,964 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 00:13:13,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:13,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:13,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:35 [2019-01-14 00:13:14,096 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 11 treesize of output 8 [2019-01-14 00:13:14,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:13:14,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:14,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:14,130 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 11 treesize of output 8 [2019-01-14 00:13:14,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:13:14,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:14,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:14,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:14,158 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-01-14 00:13:14,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:13:14,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 79 [2019-01-14 00:13:14,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-14 00:13:14,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:14,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:14,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2019-01-14 00:13:14,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-14 00:13:14,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:14,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:14,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:14,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:79 [2019-01-14 00:13:15,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:13:15,035 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2019-01-14 00:13:15,114 INFO L478 Elim1Store]: Elim1 applied some 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 1 case distinctions, treesize of input 42 treesize of output 41 [2019-01-14 00:13:15,116 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 00:13:15,137 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 00:13:15,137 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:15,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:15,167 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 44 treesize of output 36 [2019-01-14 00:13:15,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 00:13:15,169 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:15,180 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 25 treesize of output 14 [2019-01-14 00:13:15,181 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:15,188 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:15,203 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 1 xjuncts. [2019-01-14 00:13:15,204 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:93, output treesize:23 [2019-01-14 00:13:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:13:15,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:13:15,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 42 [2019-01-14 00:13:15,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-14 00:13:15,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-14 00:13:15,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1705, Unknown=0, NotChecked=0, Total=1806 [2019-01-14 00:13:15,389 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand 43 states. [2019-01-14 00:13:16,953 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-01-14 00:13:17,564 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-01-14 00:13:17,805 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-01-14 00:13:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:20,277 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2019-01-14 00:13:20,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 00:13:20,278 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-14 00:13:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:20,281 INFO L225 Difference]: With dead ends: 187 [2019-01-14 00:13:20,281 INFO L226 Difference]: Without dead ends: 187 [2019-01-14 00:13:20,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=223, Invalid=3083, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 00:13:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-14 00:13:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 137. [2019-01-14 00:13:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-14 00:13:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2019-01-14 00:13:20,291 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 43 [2019-01-14 00:13:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:20,292 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2019-01-14 00:13:20,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-14 00:13:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2019-01-14 00:13:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 00:13:20,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:20,295 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:13:20,296 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:20,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:20,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2058851500, now seen corresponding path program 2 times [2019-01-14 00:13:20,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:20,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:20,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:20,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:20,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 00:13:20,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:13:20,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 00:13:20,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:13:20,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:13:20,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:13:20,510 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand 7 states. [2019-01-14 00:13:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:20,572 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-01-14 00:13:20,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:13:20,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-01-14 00:13:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:20,576 INFO L225 Difference]: With dead ends: 132 [2019-01-14 00:13:20,576 INFO L226 Difference]: Without dead ends: 132 [2019-01-14 00:13:20,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:13:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-14 00:13:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-01-14 00:13:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-14 00:13:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2019-01-14 00:13:20,583 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 46 [2019-01-14 00:13:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:20,583 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2019-01-14 00:13:20,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:13:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2019-01-14 00:13:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-14 00:13:20,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:20,587 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:13:20,588 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2085780180, now seen corresponding path program 1 times [2019-01-14 00:13:20,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:20,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:20,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:13:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 00:13:20,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:13:20,684 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 00:13:20,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:20,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:13:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 00:13:20,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:13:20,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 00:13:20,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:13:20,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:13:20,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:13:20,778 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand 5 states. [2019-01-14 00:13:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:20,834 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2019-01-14 00:13:20,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:13:20,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-01-14 00:13:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:20,839 INFO L225 Difference]: With dead ends: 141 [2019-01-14 00:13:20,839 INFO L226 Difference]: Without dead ends: 141 [2019-01-14 00:13:20,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:13:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-14 00:13:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-14 00:13:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-14 00:13:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2019-01-14 00:13:20,851 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 53 [2019-01-14 00:13:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:20,852 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2019-01-14 00:13:20,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:13:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2019-01-14 00:13:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 00:13:20,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:13:20,856 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:20,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1682133992, now seen corresponding path program 1 times [2019-01-14 00:13:20,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:20,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:20,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:20,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:20,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 00:13:21,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:13:21,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 00:13:21,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:13:21,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:13:21,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:13:21,326 INFO L87 Difference]: Start difference. First operand 141 states and 156 transitions. Second operand 7 states. [2019-01-14 00:13:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:21,414 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2019-01-14 00:13:21,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:13:21,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-14 00:13:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:21,417 INFO L225 Difference]: With dead ends: 133 [2019-01-14 00:13:21,418 INFO L226 Difference]: Without dead ends: 133 [2019-01-14 00:13:21,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:13:21,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-14 00:13:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2019-01-14 00:13:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-14 00:13:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2019-01-14 00:13:21,425 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 54 [2019-01-14 00:13:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:21,425 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2019-01-14 00:13:21,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:13:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2019-01-14 00:13:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 00:13:21,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:21,429 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:13:21,430 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:21,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:21,430 INFO L82 PathProgramCache]: Analyzing trace with hash -613479608, now seen corresponding path program 3 times [2019-01-14 00:13:21,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:21,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:21,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:21,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 00:13:21,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:13:21,807 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 00:13:21,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:13:21,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 00:13:21,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:13:21,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:13:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 00:13:22,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:13:22,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 00:13:22,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:13:22,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:13:22,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:13:22,007 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 6 states. [2019-01-14 00:13:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:22,142 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2019-01-14 00:13:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:13:22,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-01-14 00:13:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:22,145 INFO L225 Difference]: With dead ends: 110 [2019-01-14 00:13:22,145 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 00:13:22,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 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 00:13:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 00:13:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 00:13:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 00:13:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2019-01-14 00:13:22,150 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 55 [2019-01-14 00:13:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:22,151 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2019-01-14 00:13:22,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:13:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2019-01-14 00:13:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 00:13:22,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:22,152 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] [2019-01-14 00:13:22,152 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash 823098432, now seen corresponding path program 2 times [2019-01-14 00:13:22,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:22,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:22,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:13:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-14 00:13:22,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:13:22,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 00:13:22,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:13:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:13:22,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:13:22,377 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 6 states. [2019-01-14 00:13:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:22,477 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-01-14 00:13:22,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:13:22,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-01-14 00:13:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:22,500 INFO L225 Difference]: With dead ends: 114 [2019-01-14 00:13:22,500 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 00:13:22,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:13:22,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 00:13:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-01-14 00:13:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 00:13:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-01-14 00:13:22,505 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 61 [2019-01-14 00:13:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:22,506 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-01-14 00:13:22,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:13:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-01-14 00:13:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 00:13:22,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:22,509 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] [2019-01-14 00:13:22,509 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:22,510 INFO L82 PathProgramCache]: Analyzing trace with hash 823098486, now seen corresponding path program 1 times [2019-01-14 00:13:22,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:22,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:22,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:22,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:13:22,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:13:22,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:13:22,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:13:22,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:13:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:13:22,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:13:22,671 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 12 states. [2019-01-14 00:13:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:23,051 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-01-14 00:13:23,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:13:23,053 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-01-14 00:13:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:23,054 INFO L225 Difference]: With dead ends: 116 [2019-01-14 00:13:23,054 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 00:13:23,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:13:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 00:13:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2019-01-14 00:13:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 00:13:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2019-01-14 00:13:23,058 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 61 [2019-01-14 00:13:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:23,059 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2019-01-14 00:13:23,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:13:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2019-01-14 00:13:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 00:13:23,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:23,059 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] [2019-01-14 00:13:23,060 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:23,060 INFO L82 PathProgramCache]: Analyzing trace with hash 823098487, now seen corresponding path program 1 times [2019-01-14 00:13:23,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:23,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:23,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:23,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:23,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-14 00:13:23,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:13:23,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:13:23,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:13:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:13:23,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:13:23,310 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 12 states. [2019-01-14 00:13:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:13:23,658 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2019-01-14 00:13:23,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:13:23,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-01-14 00:13:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:13:23,661 INFO L225 Difference]: With dead ends: 119 [2019-01-14 00:13:23,661 INFO L226 Difference]: Without dead ends: 119 [2019-01-14 00:13:23,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:13:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-14 00:13:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2019-01-14 00:13:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 00:13:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2019-01-14 00:13:23,666 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 61 [2019-01-14 00:13:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:13:23,666 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2019-01-14 00:13:23,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:13:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2019-01-14 00:13:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 00:13:23,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:13:23,667 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, 1, 1] [2019-01-14 00:13:23,668 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:13:23,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:13:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash 958842401, now seen corresponding path program 1 times [2019-01-14 00:13:23,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:13:23,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:13:23,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:23,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:23,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:13:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:13:24,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:13:24,923 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 00:13:24,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:13:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:13:24,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:13:25,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 00:13:25,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:13:25,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:25,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:25,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:25,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-01-14 00:13:25,532 INFO L303 Elim1Store]: Index analysis took 131 ms [2019-01-14 00:13:25,581 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 30 treesize of output 38 [2019-01-14 00:13:25,586 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 31 treesize of output 30 [2019-01-14 00:13:25,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:25,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:25,624 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 00:13:25,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-01-14 00:13:26,196 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 95 [2019-01-14 00:13:26,202 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 95 treesize of output 63 [2019-01-14 00:13:26,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:26,247 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 80 treesize of output 80 [2019-01-14 00:13:26,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 00:13:26,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:13:26,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:13:26,297 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:103, output treesize:122 [2019-01-14 00:13:26,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 84 treesize of output 90 [2019-01-14 00:13:26,506 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 85 treesize of output 53 [2019-01-14 00:13:26,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:26,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:26,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:26,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:162, output treesize:36 [2019-01-14 00:13:26,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-01-14 00:13:26,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2019-01-14 00:13:26,645 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 00:13:26,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:13:26,663 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 26 treesize of output 20 [2019-01-14 00:13:26,666 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 20 treesize of output 14 [2019-01-14 00:13:26,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:26,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:26,677 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 1 xjuncts. [2019-01-14 00:13:26,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2019-01-14 00:13:53,531 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 00:13:53,540 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 35 treesize of output 30 [2019-01-14 00:13:53,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:13:53,547 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 30 treesize of output 22 [2019-01-14 00:13:53,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:53,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:53,594 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 49 treesize of output 40 [2019-01-14 00:13:53,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:13:53,602 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 40 treesize of output 36 [2019-01-14 00:13:53,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:53,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:53,628 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 1 xjuncts. [2019-01-14 00:13:53,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:41 [2019-01-14 00:13:53,826 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 00:13:53,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 19 treesize of output 11 [2019-01-14 00:13:53,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:53,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:53,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2019-01-14 00:13:53,847 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 25 treesize of output 14 [2019-01-14 00:13:53,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:13:53,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:13:53,861 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 00:13:53,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2019-01-14 00:13:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 00:13:54,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:13:54,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 56 [2019-01-14 00:13:54,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-14 00:13:54,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-14 00:13:54,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3002, Unknown=23, NotChecked=0, Total=3192 [2019-01-14 00:13:54,011 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 57 states. [2019-01-14 00:13:57,776 WARN L181 SmtUtils]: Spent 950.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 00:14:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:14:00,361 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2019-01-14 00:14:00,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 00:14:00,363 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 64 [2019-01-14 00:14:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:14:00,365 INFO L225 Difference]: With dead ends: 155 [2019-01-14 00:14:00,365 INFO L226 Difference]: Without dead ends: 155 [2019-01-14 00:14:00,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=429, Invalid=5710, Unknown=23, NotChecked=0, Total=6162 [2019-01-14 00:14:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-14 00:14:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2019-01-14 00:14:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-14 00:14:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2019-01-14 00:14:00,374 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 64 [2019-01-14 00:14:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:14:00,374 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2019-01-14 00:14:00,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-14 00:14:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2019-01-14 00:14:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 00:14:00,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:14:00,375 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, 1, 1] [2019-01-14 00:14:00,379 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:14:00,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:14:00,380 INFO L82 PathProgramCache]: Analyzing trace with hash 958842400, now seen corresponding path program 1 times [2019-01-14 00:14:00,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:14:00,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:14:00,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:00,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:14:00,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:14:01,152 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-01-14 00:14:01,697 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-01-14 00:14:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:14:02,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:14:02,348 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 00:14:02,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:14:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:14:02,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:14:02,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:14:02,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:14:02,504 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 00:14:02,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:02,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:02,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 00:14:02,569 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 11 treesize of output 8 [2019-01-14 00:14:02,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:14:02,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:02,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:02,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:02,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-14 00:14:02,648 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 28 treesize of output 24 [2019-01-14 00:14:02,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 00:14:02,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:02,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:02,661 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 00:14:02,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-01-14 00:14:03,856 WARN L181 SmtUtils]: Spent 861.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 00:14:03,866 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 60 treesize of output 50 [2019-01-14 00:14:03,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 17 [2019-01-14 00:14:03,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:14:03,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:14:03,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:14:03,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:48 [2019-01-14 00:14:03,999 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 18 treesize of output 14 [2019-01-14 00:14:04,001 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 14 treesize of output 10 [2019-01-14 00:14:04,001 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 00:14:04,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:14:04,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:14:04,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2019-01-14 00:14:13,925 WARN L181 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 00:14:13,934 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 37 treesize of output 30 [2019-01-14 00:14:13,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:14:13,939 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-01-14 00:14:13,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:13,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:13,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:14:13,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:23 [2019-01-14 00:14:14,097 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 25 treesize of output 19 [2019-01-14 00:14:14,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2019-01-14 00:14:14,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:14,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:14,106 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 00:14:14,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-01-14 00:14:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 00:14:14,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:14:14,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 49 [2019-01-14 00:14:14,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-14 00:14:14,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-14 00:14:14,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2290, Unknown=16, NotChecked=0, Total=2450 [2019-01-14 00:14:14,160 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand 50 states. [2019-01-14 00:14:21,926 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-01-14 00:14:24,918 WARN L181 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-01-14 00:14:30,688 WARN L181 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-01-14 00:14:33,716 WARN L181 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 00:14:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:14:43,949 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2019-01-14 00:14:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-14 00:14:43,952 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 64 [2019-01-14 00:14:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:14:43,953 INFO L225 Difference]: With dead ends: 148 [2019-01-14 00:14:43,953 INFO L226 Difference]: Without dead ends: 148 [2019-01-14 00:14:43,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=389, Invalid=4707, Unknown=16, NotChecked=0, Total=5112 [2019-01-14 00:14:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-14 00:14:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 121. [2019-01-14 00:14:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 00:14:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2019-01-14 00:14:43,960 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 64 [2019-01-14 00:14:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:14:43,960 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2019-01-14 00:14:43,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-14 00:14:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2019-01-14 00:14:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 00:14:43,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:14:43,963 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, 1, 1, 1] [2019-01-14 00:14:43,964 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:14:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:14:43,964 INFO L82 PathProgramCache]: Analyzing trace with hash -951769952, now seen corresponding path program 2 times [2019-01-14 00:14:43,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:14:43,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:14:43,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:43,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:14:43,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:14:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-14 00:14:44,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:14:44,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 00:14:44,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:14:44,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:14:44,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:14:44,114 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 7 states. [2019-01-14 00:14:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:14:44,208 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2019-01-14 00:14:44,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:14:44,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-01-14 00:14:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:14:44,211 INFO L225 Difference]: With dead ends: 107 [2019-01-14 00:14:44,212 INFO L226 Difference]: Without dead ends: 107 [2019-01-14 00:14:44,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:14:44,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-14 00:14:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-14 00:14:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 00:14:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2019-01-14 00:14:44,217 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 67 [2019-01-14 00:14:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:14:44,218 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2019-01-14 00:14:44,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:14:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2019-01-14 00:14:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-14 00:14:44,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:14:44,219 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:14:44,219 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:14:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:14:44,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1637067153, now seen corresponding path program 1 times [2019-01-14 00:14:44,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:14:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:14:44,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:44,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:14:44,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:14:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-14 00:14:44,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:14:44,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 00:14:44,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:14:44,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:14:44,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:14:44,626 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 7 states. [2019-01-14 00:14:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:14:44,792 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2019-01-14 00:14:44,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:14:44,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-01-14 00:14:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:14:44,796 INFO L225 Difference]: With dead ends: 131 [2019-01-14 00:14:44,796 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 00:14:44,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:14:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 00:14:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 110. [2019-01-14 00:14:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 00:14:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-01-14 00:14:44,801 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 86 [2019-01-14 00:14:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:14:44,801 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-01-14 00:14:44,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:14:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-01-14 00:14:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-14 00:14:44,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:14:44,803 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:14:44,809 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:14:44,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:14:44,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1637067152, now seen corresponding path program 1 times [2019-01-14 00:14:44,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:14:44,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:14:44,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:44,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:14:44,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:14:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-14 00:14:45,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:14:45,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:14:45,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:14:45,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:14:45,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:14:45,126 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 12 states. [2019-01-14 00:14:45,865 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 00:14:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:14:46,799 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2019-01-14 00:14:46,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:14:46,800 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-01-14 00:14:46,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:14:46,802 INFO L225 Difference]: With dead ends: 108 [2019-01-14 00:14:46,802 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 00:14:46,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:14:46,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 00:14:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-14 00:14:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 00:14:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2019-01-14 00:14:46,808 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 86 [2019-01-14 00:14:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:14:46,808 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2019-01-14 00:14:46,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:14:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2019-01-14 00:14:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-14 00:14:46,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:14:46,811 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:14:46,811 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:14:46,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:14:46,812 INFO L82 PathProgramCache]: Analyzing trace with hash -513843116, now seen corresponding path program 1 times [2019-01-14 00:14:46,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:14:46,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:14:46,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:46,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:14:46,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:14:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 00:14:47,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:14:47,166 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 00:14:47,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:14:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:14:47,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:14:47,498 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 00:14:47,504 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 00:14:47,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:47,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:47,508 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 00:14:47,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-14 00:14:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-14 00:14:47,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:14:47,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2019-01-14 00:14:47,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:14:47,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:14:47,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:14:47,543 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 12 states. [2019-01-14 00:14:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:14:47,894 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-01-14 00:14:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 00:14:47,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-01-14 00:14:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:14:47,897 INFO L225 Difference]: With dead ends: 125 [2019-01-14 00:14:47,897 INFO L226 Difference]: Without dead ends: 125 [2019-01-14 00:14:47,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-01-14 00:14:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-14 00:14:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2019-01-14 00:14:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 00:14:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-01-14 00:14:47,902 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 89 [2019-01-14 00:14:47,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:14:47,902 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-01-14 00:14:47,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:14:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-01-14 00:14:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-14 00:14:47,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:14:47,903 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:14:47,904 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:14:47,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:14:47,904 INFO L82 PathProgramCache]: Analyzing trace with hash -513843115, now seen corresponding path program 1 times [2019-01-14 00:14:47,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:14:47,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:14:47,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:47,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:14:47,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:14:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:14:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 00:14:49,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:14:49,618 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 00:14:49,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:14:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:14:49,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:14:50,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:14:50,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:14:50,021 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 00:14:50,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:50,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:50,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-01-14 00:14:50,055 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 11 treesize of output 8 [2019-01-14 00:14:50,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:14:50,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:50,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:50,072 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 11 treesize of output 8 [2019-01-14 00:14:50,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:14:50,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:50,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:50,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:50,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-01-14 00:14:50,136 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 47 treesize of output 43 [2019-01-14 00:14:50,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 00:14:50,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:50,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:50,460 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 27 treesize of output 28 [2019-01-14 00:14:50,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 00:14:50,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:50,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:50,683 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 00:14:50,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2019-01-14 00:14:51,875 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) |c_#memory_$Pointer$.offset|)) is different from true [2019-01-14 00:14:51,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:14:51,883 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:14:51,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 56 [2019-01-14 00:14:51,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 17 [2019-01-14 00:14:51,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:14:51,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:14:51,955 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 32 treesize of output 29 [2019-01-14 00:14:51,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, 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 00:14:51,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:51,973 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 00:14:51,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:52,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:52,025 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 38 treesize of output 33 [2019-01-14 00:14:52,034 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 16 treesize of output 15 [2019-01-14 00:14:52,035 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:14:52,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, 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 00:14:52,081 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:52,086 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:14:52,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:14:52,109 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:72, output treesize:34 [2019-01-14 00:14:52,793 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.offset|))) is different from true [2019-01-14 00:14:52,799 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 27 treesize of output 22 [2019-01-14 00:14:52,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:14:52,804 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 22 treesize of output 14 [2019-01-14 00:14:52,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:52,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:52,812 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 00:14:52,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:11 [2019-01-14 00:14:53,436 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 00:14:53,444 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 00:14:53,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:53,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:53,452 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 26 treesize of output 20 [2019-01-14 00:14:53,456 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 00:14:53,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:14:53,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:14:53,465 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 00:14:53,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2019-01-14 00:14:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-01-14 00:14:53,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:14:53,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38] total 60 [2019-01-14 00:14:53,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-14 00:14:53,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-14 00:14:53,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3219, Unknown=8, NotChecked=230, Total=3660 [2019-01-14 00:14:53,642 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 61 states. [2019-01-14 00:14:57,013 WARN L181 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-01-14 00:14:58,330 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-14 00:15:01,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:15:01,068 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2019-01-14 00:15:01,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 00:15:01,069 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 89 [2019-01-14 00:15:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:15:01,071 INFO L225 Difference]: With dead ends: 125 [2019-01-14 00:15:01,071 INFO L226 Difference]: Without dead ends: 125 [2019-01-14 00:15:01,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1921 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=604, Invalid=7757, Unknown=19, NotChecked=362, Total=8742 [2019-01-14 00:15:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-14 00:15:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2019-01-14 00:15:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 00:15:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2019-01-14 00:15:01,078 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 89 [2019-01-14 00:15:01,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:15:01,078 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2019-01-14 00:15:01,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-14 00:15:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2019-01-14 00:15:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-14 00:15:01,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:15:01,079 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:15:01,079 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:15:01,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:15:01,083 INFO L82 PathProgramCache]: Analyzing trace with hash -481310733, now seen corresponding path program 1 times [2019-01-14 00:15:01,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:15:01,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:15:01,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:15:01,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:15:01,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:15:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:15:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-14 00:15:01,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:15:01,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 00:15:01,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:15:01,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:15:01,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:15:01,448 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 12 states. [2019-01-14 00:15:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:15:01,633 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2019-01-14 00:15:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:15:01,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-01-14 00:15:01,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:15:01,636 INFO L225 Difference]: With dead ends: 112 [2019-01-14 00:15:01,637 INFO L226 Difference]: Without dead ends: 110 [2019-01-14 00:15:01,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:15:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-14 00:15:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-14 00:15:01,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 00:15:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2019-01-14 00:15:01,640 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 89 [2019-01-14 00:15:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:15:01,643 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2019-01-14 00:15:01,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:15:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2019-01-14 00:15:01,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 00:15:01,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:15:01,644 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:15:01,644 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:15:01,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:15:01,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1250731190, now seen corresponding path program 1 times [2019-01-14 00:15:01,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:15:01,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:15:01,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:15:01,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:15:01,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:15:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:15:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-14 00:15:02,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:15:02,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:15:02,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:15:02,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:15:02,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:15:02,056 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand 12 states. [2019-01-14 00:15:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:15:02,340 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-01-14 00:15:02,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:15:02,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-01-14 00:15:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:15:02,343 INFO L225 Difference]: With dead ends: 109 [2019-01-14 00:15:02,343 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 00:15:02,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:15:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 00:15:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-14 00:15:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 00:15:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-01-14 00:15:02,347 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 90 [2019-01-14 00:15:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:15:02,347 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-01-14 00:15:02,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:15:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-01-14 00:15:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 00:15:02,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:15:02,348 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:15:02,349 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:15:02,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:15:02,349 INFO L82 PathProgramCache]: Analyzing trace with hash -636747301, now seen corresponding path program 1 times [2019-01-14 00:15:02,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:15:02,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:15:02,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:15:02,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:15:02,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:15:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:15:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 00:15:03,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:15:03,518 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 00:15:03,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:15:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:15:03,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:15:03,823 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 00:15:03,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:03,829 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 00:15:03,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 00:15:03,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:15:03,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:15:03,954 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 00:15:03,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:03,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:03,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2019-01-14 00:15:04,083 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 11 treesize of output 8 [2019-01-14 00:15:04,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:15:04,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:04,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:04,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:04,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-01-14 00:15:04,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:15:04,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2019-01-14 00:15:04,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 22 treesize of output 24 [2019-01-14 00:15:04,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:04,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:04,255 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 00:15:04,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2019-01-14 00:15:04,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:15:04,983 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 29 treesize of output 28 [2019-01-14 00:15:05,092 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2019-01-14 00:15:05,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:05,138 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 00:15:05,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:05,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:05,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:05,222 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:3 [2019-01-14 00:15:06,218 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))) |c_#memory_$Pointer$.base|)) is different from true [2019-01-14 00:15:06,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:15:06,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 60 treesize of output 56 [2019-01-14 00:15:06,260 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 36 treesize of output 51 [2019-01-14 00:15:06,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2019-01-14 00:15:06,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:15:06,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:15:06,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:72 [2019-01-14 00:15:06,425 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 18 treesize of output 14 [2019-01-14 00:15:06,429 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 14 treesize of output 10 [2019-01-14 00:15:06,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:06,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:06,455 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 00:15:06,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-01-14 00:15:07,049 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-01-14 00:15:07,055 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 37 treesize of output 30 [2019-01-14 00:15:07,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:15:07,061 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-01-14 00:15:07,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:07,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:07,078 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 00:15:07,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:27 [2019-01-14 00:15:07,634 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 25 treesize of output 19 [2019-01-14 00:15:07,636 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 00:15:07,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:15:07,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:15:07,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:15:07,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:11 [2019-01-14 00:15:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2019-01-14 00:15:07,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:15:07,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33] total 58 [2019-01-14 00:15:07,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-14 00:15:07,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-14 00:15:07,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3009, Unknown=2, NotChecked=222, Total=3422 [2019-01-14 00:15:07,747 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 59 states. [2019-01-14 00:15:11,098 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-01-14 00:15:13,113 WARN L181 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-01-14 00:15:16,454 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-14 00:15:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:15:20,730 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2019-01-14 00:15:20,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 00:15:20,732 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 92 [2019-01-14 00:15:20,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:15:20,734 INFO L225 Difference]: With dead ends: 115 [2019-01-14 00:15:20,736 INFO L226 Difference]: Without dead ends: 115 [2019-01-14 00:15:20,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=443, Invalid=5725, Unknown=2, NotChecked=310, Total=6480 [2019-01-14 00:15:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-14 00:15:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2019-01-14 00:15:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 00:15:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2019-01-14 00:15:20,742 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 92 [2019-01-14 00:15:20,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:15:20,747 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2019-01-14 00:15:20,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-14 00:15:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2019-01-14 00:15:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-14 00:15:20,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:15:20,748 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:15:20,748 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:15:20,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:15:20,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2028921689, now seen corresponding path program 1 times [2019-01-14 00:15:20,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:15:20,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:15:20,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:15:20,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:15:20,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:15:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:15:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 00:15:21,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:15:21,559 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 00:15:21,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:15:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:15:21,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:15:21,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:15:21,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:15:21,726 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 00:15:21,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:21,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:21,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-14 00:15:21,752 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 11 treesize of output 8 [2019-01-14 00:15:21,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:15:21,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:21,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:21,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:21,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-01-14 00:15:21,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-14 00:15:21,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 00:15:21,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:21,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:21,818 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 00:15:21,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-01-14 00:15:23,156 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))) |c_#memory_$Pointer$.base|)) is different from true [2019-01-14 00:15:23,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:15:23,162 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:15:23,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2019-01-14 00:15:23,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2019-01-14 00:15:23,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:15:23,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:15:23,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:15:23,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:36 [2019-01-14 00:15:23,845 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-01-14 00:15:23,850 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 28 treesize of output 23 [2019-01-14 00:15:23,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:15:23,858 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-14 00:15:23,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:15:23,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:15:23,868 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 00:15:23,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:12 [2019-01-14 00:15:25,885 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_23 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_23) 0) v_main_~s~0.base_BEFORE_CALL_23))) is different from true [2019-01-14 00:15:27,947 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_24 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_24 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_24) 0)))) is different from true [2019-01-14 00:15:30,078 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_25 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_25 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_25) 0)))) is different from true [2019-01-14 00:15:42,274 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 00:15:44,322 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 00:15:46,370 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 00:15:48,415 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 00:15:50,475 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 00:15:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 9 not checked. [2019-01-14 00:15:50,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:15:50,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35] total 52 [2019-01-14 00:15:50,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-14 00:15:50,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-14 00:15:50,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2024, Unknown=10, NotChecked=470, Total=2652 [2019-01-14 00:15:50,518 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 52 states. [2019-01-14 00:15:53,515 WARN L181 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-01-14 00:15:54,911 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-14 00:16:07,036 WARN L181 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-14 00:16:19,382 WARN L181 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-01-14 00:16:23,491 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-01-14 00:16:27,573 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-14 00:16:31,665 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-14 00:16:35,793 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-14 00:16:39,969 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-14 00:16:44,122 WARN L181 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-14 00:16:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:16:44,355 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-01-14 00:16:44,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-14 00:16:44,357 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 95 [2019-01-14 00:16:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:16:44,361 INFO L225 Difference]: With dead ends: 113 [2019-01-14 00:16:44,361 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 00:16:44,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 69 SyntacticMatches, 11 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 81.3s TimeCoverageRelationStatistics Valid=368, Invalid=4193, Unknown=15, NotChecked=680, Total=5256 [2019-01-14 00:16:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 00:16:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-01-14 00:16:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 00:16:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-01-14 00:16:44,376 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 95 [2019-01-14 00:16:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:16:44,376 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-01-14 00:16:44,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-14 00:16:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-01-14 00:16:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-14 00:16:44,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:16:44,377 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:16:44,378 INFO L423 AbstractCegarLoop]: === Iteration 32 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:16:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:16:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1531846009, now seen corresponding path program 1 times [2019-01-14 00:16:44,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:16:44,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:16:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:16:44,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:16:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:16:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:16:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 00:16:46,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:16:46,216 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 00:16:46,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:16:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:16:46,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:16:46,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 00:16:46,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:16:46,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:46,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:46,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:46,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-01-14 00:16:46,992 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 42 [2019-01-14 00:16:46,995 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 40 treesize of output 39 [2019-01-14 00:16:46,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:47,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:47,030 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 19 treesize of output 12 [2019-01-14 00:16:47,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 00:16:47,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:47,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:47,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:47,052 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:26 [2019-01-14 00:16:48,464 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|)) (.cse1 (+ sll_circular_update_at_~head.offset 4))) (and (<= (select (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|)))) is different from true [2019-01-14 00:16:48,472 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:16:48,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 71 [2019-01-14 00:16:48,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 44 [2019-01-14 00:16:48,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:16:48,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:16:48,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:48,588 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:16:48,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:48,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 78 [2019-01-14 00:16:48,599 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:16:48,617 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 36 treesize of output 41 [2019-01-14 00:16:48,619 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 00:16:48,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:48,643 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:16:48,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 69 [2019-01-14 00:16:48,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 55 [2019-01-14 00:16:48,681 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-14 00:16:48,735 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:16:48,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:16:48,762 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-01-14 00:16:49,916 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-01-14 00:16:49,924 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 62 treesize of output 57 [2019-01-14 00:16:49,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:49,931 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 24 treesize of output 16 [2019-01-14 00:16:49,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:49,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:49,991 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 43 treesize of output 38 [2019-01-14 00:16:49,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:49,998 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-14 00:16:49,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:50,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:50,068 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 78 [2019-01-14 00:16:50,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:50,075 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2019-01-14 00:16:50,075 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:50,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:50,160 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 56 treesize of output 50 [2019-01-14 00:16:50,161 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:50,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:50,240 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 48 treesize of output 68 [2019-01-14 00:16:50,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2019-01-14 00:16:50,245 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:50,275 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:50,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:16:50,295 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:130, output treesize:48 [2019-01-14 00:16:51,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:51,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:51,410 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 62 treesize of output 61 [2019-01-14 00:16:51,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:51,430 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2019-01-14 00:16:51,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 00:16:51,452 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 15 [2019-01-14 00:16:51,452 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 00:16:51,465 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 00:16:51,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:51,513 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 66 treesize of output 57 [2019-01-14 00:16:51,537 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 31 [2019-01-14 00:16:51,540 INFO L267 ElimStorePlain]: Start of recursive call 6: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2019-01-14 00:16:51,573 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 25 treesize of output 19 [2019-01-14 00:16:51,574 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 00:16:51,590 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:16:51,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:51,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:51,695 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-01-14 00:16:51,703 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 18 [2019-01-14 00:16:51,704 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:51,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:51,719 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 00:16:51,720 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:51,726 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:51,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:51,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:16:51,815 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-01-14 00:16:51,853 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2019-01-14 00:16:51,855 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 00:16:51,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-14 00:16:51,870 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:51,876 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:16:51,880 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 35 treesize of output 33 [2019-01-14 00:16:51,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 00:16:51,889 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2019-01-14 00:16:51,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-14 00:16:51,907 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 00:16:51,942 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:16:52,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 00:16:52,084 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:247, output treesize:50 [2019-01-14 00:16:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 2 not checked. [2019-01-14 00:16:52,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:16:52,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 64 [2019-01-14 00:16:52,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-14 00:16:52,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-14 00:16:52,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3591, Unknown=2, NotChecked=242, Total=4032 [2019-01-14 00:16:52,758 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 64 states. [2019-01-14 00:16:56,847 WARN L181 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-01-14 00:16:59,315 WARN L181 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 59 DAG size of output: 28 [2019-01-14 00:17:01,315 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-01-14 00:17:01,711 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-01-14 00:17:02,012 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-01-14 00:17:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:17:02,234 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-14 00:17:02,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 00:17:02,237 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 95 [2019-01-14 00:17:02,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:17:02,238 INFO L225 Difference]: With dead ends: 103 [2019-01-14 00:17:02,238 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 00:17:02,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=507, Invalid=6809, Unknown=2, NotChecked=338, Total=7656 [2019-01-14 00:17:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 00:17:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-01-14 00:17:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 00:17:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2019-01-14 00:17:02,243 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 95 [2019-01-14 00:17:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:17:02,243 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2019-01-14 00:17:02,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-14 00:17:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2019-01-14 00:17:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-14 00:17:02,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:17:02,248 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:17:02,248 INFO L423 AbstractCegarLoop]: === Iteration 33 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:17:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:17:02,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1069811063, now seen corresponding path program 1 times [2019-01-14 00:17:02,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:17:02,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:17:02,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:17:02,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:17:02,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:17:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:17:02,951 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-01-14 00:17:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:17:03,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:17:03,642 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 00:17:03,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:17:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:17:03,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:17:03,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:03,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2019-01-14 00:17:03,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:17:03,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:03,938 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 15 treesize of output 18 [2019-01-14 00:17:03,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:17:03,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 00:17:03,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:38 [2019-01-14 00:17:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 00:17:04,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:17:04,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7] total 39 [2019-01-14 00:17:04,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-14 00:17:04,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-14 00:17:04,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1452, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 00:17:04,098 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 40 states. [2019-01-14 00:17:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:17:06,485 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2019-01-14 00:17:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 00:17:06,488 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 97 [2019-01-14 00:17:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:17:06,489 INFO L225 Difference]: With dead ends: 98 [2019-01-14 00:17:06,489 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 00:17:06,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=314, Invalid=3226, Unknown=0, NotChecked=0, Total=3540 [2019-01-14 00:17:06,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 00:17:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-14 00:17:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 00:17:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2019-01-14 00:17:06,502 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 97 [2019-01-14 00:17:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:17:06,502 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2019-01-14 00:17:06,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-14 00:17:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2019-01-14 00:17:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-14 00:17:06,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:17:06,506 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:17:06,507 INFO L423 AbstractCegarLoop]: === Iteration 34 === [sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:17:06,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:17:06,507 INFO L82 PathProgramCache]: Analyzing trace with hash -175855092, now seen corresponding path program 1 times [2019-01-14 00:17:06,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:17:06,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:17:06,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:17:06,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:17:06,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:17:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:17:07,045 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-14 00:17:07,468 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-14 00:17:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 00:17:08,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:17:08,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 00:17:08,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:17:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:17:08,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:17:09,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 00:17:09,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:17:09,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:17:09,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:17:09,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:17:09,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-01-14 00:17:09,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:09,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:09,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 54 treesize of output 67 [2019-01-14 00:17:09,543 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 22 treesize of output 24 [2019-01-14 00:17:09,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:17:09,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:17:09,576 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 00:17:09,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:58 [2019-01-14 00:17:09,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:09,919 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2019-01-14 00:17:09,922 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 27 treesize of output 23 [2019-01-14 00:17:09,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:17:09,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:17:09,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:09,953 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 29 treesize of output 28 [2019-01-14 00:17:09,963 INFO L478 Elim1Store]: Elim1 applied some 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 10 treesize of output 15 [2019-01-14 00:17:09,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:17:09,970 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 14 treesize of output 10 [2019-01-14 00:17:09,971 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 00:17:09,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:17:09,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:17:09,992 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:61, output treesize:18 [2019-01-14 00:17:16,637 WARN L181 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 00:17:16,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:16,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:16,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 77 treesize of output 81 [2019-01-14 00:17:16,708 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 36 treesize of output 51 [2019-01-14 00:17:16,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2019-01-14 00:17:16,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:17:16,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-14 00:17:16,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:103, output treesize:128 [2019-01-14 00:17:16,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:16,961 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2019-01-14 00:17:16,965 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 27 treesize of output 23 [2019-01-14 00:17:16,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:17:16,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:17:16,985 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 18 treesize of output 14 [2019-01-14 00:17:17,002 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 14 treesize of output 10 [2019-01-14 00:17:17,004 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 00:17:17,009 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 00:17:17,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:17:17,020 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-01-14 00:17:24,211 WARN L181 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 00:17:24,218 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 54 treesize of output 45 [2019-01-14 00:17:24,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:24,224 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 45 treesize of output 41 [2019-01-14 00:17:24,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:17:24,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:17:24,252 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 00:17:24,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:55 [2019-01-14 00:17:24,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:24,347 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2019-01-14 00:17:24,350 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 27 treesize of output 23 [2019-01-14 00:17:24,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:17:24,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:17:24,362 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 00:17:24,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2019-01-14 00:17:24,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:17:24,558 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2019-01-14 00:17:24,562 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 27 treesize of output 23 [2019-01-14 00:17:24,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:17:24,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:17:24,576 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 00:17:24,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2019-01-14 00:17:24,817 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 00:17:24,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-14 00:17:24,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:17:24,906 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 00:17:24,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 [2019-01-14 00:17:34,969 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 00:17:43,034 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 00:17:45,112 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 00:17:47,188 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 00:17:49,273 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 00:18:05,779 WARN L181 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 00:18:07,786 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((sll_circular_destroy_~head.offset Int)) (and (<= sll_circular_destroy_~head.offset 0) (<= 0 sll_circular_destroy_~head.offset) (= |c_#valid| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_sll_circular_destroy_#in~head.base|) sll_circular_destroy_~head.offset) 0) |c_sll_circular_destroy_#in~head.base| 0)))) (exists ((main_~s~0.offset Int) (v_main_~s~0.base_BEFORE_CALL_35 Int)) (and (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_35) main_~s~0.offset) v_main_~s~0.base_BEFORE_CALL_35)) (<= 0 main_~s~0.offset) (<= main_~s~0.offset 0)))) is different from true [2019-01-14 00:18:07,802 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 53 treesize of output 51 [2019-01-14 00:18:07,806 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 47 treesize of output 45 [2019-01-14 00:18:07,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:18:07,834 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:18:07,836 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:18:07,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-14 00:18:07,838 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 00:18:07,945 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:18:07,946 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 0 case distinctions, treesize of input 41 treesize of output 36 [2019-01-14 00:18:07,948 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 00:18:07,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:18:08,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-14 00:18:08,019 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:71, output treesize:59 [2019-01-14 00:18:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 00:18:29,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:18:29,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 63 [2019-01-14 00:18:29,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-14 00:18:29,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-14 00:18:29,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3629, Unknown=56, NotChecked=122, Total=4032 [2019-01-14 00:18:29,862 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 64 states. [2019-01-14 00:19:03,909 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-01-14 00:19:16,165 WARN L181 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-01-14 00:19:56,061 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-01-14 00:20:02,367 WARN L181 SmtUtils]: Spent 5.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-14 00:20:08,129 WARN L181 SmtUtils]: Spent 5.11 s on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-14 00:20:10,175 WARN L181 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-01-14 00:20:10,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:20:10,177 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-14 00:20:10,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-14 00:20:10,177 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 101 [2019-01-14 00:20:10,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:20:10,177 INFO L225 Difference]: With dead ends: 97 [2019-01-14 00:20:10,177 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 00:20:10,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 105.4s TimeCoverageRelationStatistics Valid=443, Invalid=6141, Unknown=62, NotChecked=160, Total=6806 [2019-01-14 00:20:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 00:20:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 00:20:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 00:20:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 00:20:10,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2019-01-14 00:20:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:20:10,179 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 00:20:10,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-14 00:20:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 00:20:10,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 00:20:10,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:20:10 BoogieIcfgContainer [2019-01-14 00:20:10,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:20:10,185 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:20:10,185 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:20:10,186 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:20:10,186 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:12:54" (3/4) ... [2019-01-14 00:20:10,190 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 00:20:10,198 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 00:20:10,198 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 00:20:10,198 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_get_data_at [2019-01-14 00:20:10,198 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 00:20:10,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 00:20:10,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2019-01-14 00:20:10,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_destroy [2019-01-14 00:20:10,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 00:20:10,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_update_at [2019-01-14 00:20:10,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-14 00:20:10,206 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-01-14 00:20:10,206 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-14 00:20:10,207 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 00:20:10,278 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:20:10,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:20:10,280 INFO L168 Benchmark]: Toolchain (without parser) took 437312.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.3 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -262.3 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-01-14 00:20:10,283 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:20:10,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:20:10,284 INFO L168 Benchmark]: Boogie Preprocessor took 87.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:20:10,284 INFO L168 Benchmark]: RCFGBuilder took 1047.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-01-14 00:20:10,285 INFO L168 Benchmark]: TraceAbstraction took 435385.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:20:10,286 INFO L168 Benchmark]: Witness Printer took 93.35 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.5 kB). Peak memory consumption was 26.5 kB. Max. memory is 11.5 GB. [2019-01-14 00:20:10,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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 692.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1047.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 435385.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 93.35 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.5 kB). Peak memory consumption was 26.5 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: 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: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free 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: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 607]: 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: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: 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: 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 - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 110 locations, 27 error locations. SAFE Result, 435.3s OverallTime, 34 OverallIterations, 3 TraceHistogramMax, 241.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2467 SDtfs, 2982 SDslu, 15282 SDs, 0 SdLazy, 28205 SolverSat, 768 SolverUnsat, 126 SolverUnknown, 0 SolverNotchecked, 130.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1817 GetRequests, 825 SyntacticMatches, 52 SemanticMatches, 940 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 10449 ImplicationChecksByTransitivity, 288.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=15, 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, 34 MinimizatonAttempts, 281 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 190.9s InterpolantComputationTime, 3023 NumberOfCodeBlocks, 3013 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2974 ConstructedInterpolants, 216 QuantifiedInterpolants, 2326371 SizeOfPredicates, 274 NumberOfNonLiveVariables, 4981 ConjunctsInSsa, 1009 ConjunctsInUnsatCore, 49 InterpolantComputations, 19 PerfectInterpolantSequences, 700/1024 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...