./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all.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 5b8a3c71378af91196ed2f84e64deb923f93cbb4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 07:26:07,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:26:07,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:26:07,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:26:07,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:26:07,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:26:07,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:26:07,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:26:07,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:26:07,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:26:07,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:26:07,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:26:07,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:26:07,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:26:07,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:26:07,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:26:07,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:26:07,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:26:07,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:26:07,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:26:07,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:26:07,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:26:07,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:26:07,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:26:07,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:26:07,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:26:07,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:26:07,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:26:07,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:26:07,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:26:07,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:26:07,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:26:07,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:26:07,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:26:07,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:26:07,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:26:07,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:26:07,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:26:07,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:26:07,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:26:07,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:26:07,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 07:26:07,198 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:26:07,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:26:07,199 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:26:07,199 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:26:07,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:26:07,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:26:07,201 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:26:07,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:26:07,201 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:26:07,202 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:26:07,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:26:07,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:26:07,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:26:07,202 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:26:07,202 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:26:07,203 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:26:07,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:26:07,203 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:26:07,203 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:26:07,203 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:26:07,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:26:07,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:26:07,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:26:07,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:26:07,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:26:07,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:26:07,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:26:07,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:26:07,205 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:26:07,205 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 5b8a3c71378af91196ed2f84e64deb923f93cbb4 [2021-08-27 07:26:07,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:26:07,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:26:07,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:26:07,536 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:26:07,536 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:26:07,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-08-27 07:26:07,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8979b5f4/a2200660f6f7404aac4bc8fa874bc436/FLAG754e6327f [2021-08-27 07:26:08,194 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:26:08,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-08-27 07:26:08,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8979b5f4/a2200660f6f7404aac4bc8fa874bc436/FLAG754e6327f [2021-08-27 07:26:08,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8979b5f4/a2200660f6f7404aac4bc8fa874bc436 [2021-08-27 07:26:08,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:26:08,585 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:26:08,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:26:08,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:26:08,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:26:08,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:26:08" (1/1) ... [2021-08-27 07:26:08,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6f2750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:26:08, skipping insertion in model container [2021-08-27 07:26:08,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:26:08" (1/1) ... [2021-08-27 07:26:08,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:26:08,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:26:08,912 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-08-27 07:26:08,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:26:08,933 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:26:08,971 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-08-27 07:26:08,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:26:08,997 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:26:08,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:26:08 WrapperNode [2021-08-27 07:26:08,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:26:08,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:26:08,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:26:08,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:26:09,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:26:08" (1/1) ... [2021-08-27 07:26:09,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:26:08" (1/1) ... [2021-08-27 07:26:09,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:26:08" (1/1) ... [2021-08-27 07:26:09,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:26:08" (1/1) ... [2021-08-27 07:26:09,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:26:08" (1/1) ... [2021-08-27 07:26:09,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:26:08" (1/1) ... [2021-08-27 07:26:09,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:26:08" (1/1) ... [2021-08-27 07:26:09,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:26:09,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:26:09,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:26:09,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:26:09,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:26:08" (1/1) ... [2021-08-27 07:26:09,062 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:26:09,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:09,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 07:26:09,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 07:26:09,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:26:09,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:26:09,147 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:26:09,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 07:26:09,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 07:26:09,148 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-08-27 07:26:09,148 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-08-27 07:26:09,148 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2021-08-27 07:26:09,148 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2021-08-27 07:26:09,149 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2021-08-27 07:26:09,149 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2021-08-27 07:26:09,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:26:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:26:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:26:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 07:26:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 07:26:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:26:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:26:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 07:26:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 07:26:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 07:26:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 07:26:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 07:26:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 07:26:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 07:26:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 07:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 07:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 07:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 07:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 07:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 07:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 07:26:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 07:26:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 07:26:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 07:26:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 07:26:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 07:26:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 07:26:09,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 07:26:09,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 07:26:09,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 07:26:09,154 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 07:26:09,154 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 07:26:09,154 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 07:26:09,155 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 07:26:09,155 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 07:26:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 07:26:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 07:26:09,157 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 07:26:09,157 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 07:26:09,157 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 07:26:09,157 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 07:26:09,157 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 07:26:09,158 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 07:26:09,158 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 07:26:09,158 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 07:26:09,158 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 07:26:09,158 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 07:26:09,158 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 07:26:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 07:26:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 07:26:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 07:26:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 07:26:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 07:26:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 07:26:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 07:26:09,161 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 07:26:09,161 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 07:26:09,162 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 07:26:09,162 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 07:26:09,162 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 07:26:09,162 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 07:26:09,162 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 07:26:09,163 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 07:26:09,163 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 07:26:09,163 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 07:26:09,163 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 07:26:09,164 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 07:26:09,164 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 07:26:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 07:26:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 07:26:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 07:26:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 07:26:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 07:26:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 07:26:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 07:26:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 07:26:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 07:26:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 07:26:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 07:26:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 07:26:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 07:26:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 07:26:09,172 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 07:26:09,172 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 07:26:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 07:26:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 07:26:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 07:26:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 07:26:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 07:26:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 07:26:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 07:26:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 07:26:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 07:26:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 07:26:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 07:26:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 07:26:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 07:26:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 07:26:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 07:26:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 07:26:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 07:26:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 07:26:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 07:26:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 07:26:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 07:26:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 07:26:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 07:26:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 07:26:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 07:26:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 07:26:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 07:26:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-08-27 07:26:09,178 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-08-27 07:26:09,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 07:26:09,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 07:26:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:26:09,180 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2021-08-27 07:26:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2021-08-27 07:26:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 07:26:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:26:09,183 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2021-08-27 07:26:09,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:26:09,183 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2021-08-27 07:26:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:26:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:26:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:26:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:26:09,659 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-08-27 07:26:09,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:26:09,925 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-08-27 07:26:09,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:26:09 BoogieIcfgContainer [2021-08-27 07:26:09,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:26:09,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:26:09,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:26:09,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:26:09,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:26:08" (1/3) ... [2021-08-27 07:26:09,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262d9875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:26:09, skipping insertion in model container [2021-08-27 07:26:09,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:26:08" (2/3) ... [2021-08-27 07:26:09,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262d9875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:26:09, skipping insertion in model container [2021-08-27 07:26:09,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:26:09" (3/3) ... [2021-08-27 07:26:09,934 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2021-08-27 07:26:09,939 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:26:09,952 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-08-27 07:26:09,987 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:26:09,992 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 07:26:09,993 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-08-27 07:26:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 59 states have (on average 1.728813559322034) internal successors, (102), 87 states have internal predecessors, (102), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 07:26:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 07:26:10,020 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:10,021 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:10,021 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:10,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1445934727, now seen corresponding path program 1 times [2021-08-27 07:26:10,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:10,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963344605] [2021-08-27 07:26:10,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:10,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:10,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:26:10,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:10,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963344605] [2021-08-27 07:26:10,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963344605] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:10,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:26:10,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:26:10,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932132400] [2021-08-27 07:26:10,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:26:10,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:10,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:26:10,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:26:10,315 INFO L87 Difference]: Start difference. First operand has 104 states, 59 states have (on average 1.728813559322034) internal successors, (102), 87 states have internal predecessors, (102), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:26:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:10,591 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2021-08-27 07:26:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:26:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 07:26:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:10,604 INFO L225 Difference]: With dead ends: 121 [2021-08-27 07:26:10,605 INFO L226 Difference]: Without dead ends: 115 [2021-08-27 07:26:10,606 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:26:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-27 07:26:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2021-08-27 07:26:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 81 states have internal predecessors, (88), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 07:26:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2021-08-27 07:26:10,655 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 12 [2021-08-27 07:26:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:10,656 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2021-08-27 07:26:10,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:26:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2021-08-27 07:26:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 07:26:10,659 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:10,659 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:10,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:26:10,660 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:10,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1445934728, now seen corresponding path program 1 times [2021-08-27 07:26:10,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:10,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013769029] [2021-08-27 07:26:10,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:10,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:10,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:26:10,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:10,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013769029] [2021-08-27 07:26:10,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013769029] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:10,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:26:10,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:26:10,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022274870] [2021-08-27 07:26:10,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:26:10,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:10,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:26:10,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:26:10,786 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:26:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:10,987 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2021-08-27 07:26:10,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:26:10,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 07:26:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:10,989 INFO L225 Difference]: With dead ends: 113 [2021-08-27 07:26:10,989 INFO L226 Difference]: Without dead ends: 113 [2021-08-27 07:26:10,990 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:26:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-27 07:26:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2021-08-27 07:26:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 79 states have internal predecessors, (86), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 07:26:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-08-27 07:26:10,998 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 12 [2021-08-27 07:26:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:10,998 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-08-27 07:26:10,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:26:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-08-27 07:26:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 07:26:10,999 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:10,999 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:11,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:26:11,000 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting sll_circular_createErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1652501893, now seen corresponding path program 1 times [2021-08-27 07:26:11,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:11,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533974337] [2021-08-27 07:26:11,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:11,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:11,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:26:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:26:11,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:11,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533974337] [2021-08-27 07:26:11,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533974337] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:11,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:26:11,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:26:11,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029720067] [2021-08-27 07:26:11,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:26:11,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:11,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:26:11,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:26:11,119 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 07:26:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:11,525 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2021-08-27 07:26:11,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:26:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-08-27 07:26:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:11,530 INFO L225 Difference]: With dead ends: 120 [2021-08-27 07:26:11,530 INFO L226 Difference]: Without dead ends: 120 [2021-08-27 07:26:11,531 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 153.1ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:26:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-08-27 07:26:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2021-08-27 07:26:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 80 states have internal predecessors, (87), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 07:26:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-08-27 07:26:11,552 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 19 [2021-08-27 07:26:11,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:11,552 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-08-27 07:26:11,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 07:26:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-08-27 07:26:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:26:11,553 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:11,553 INFO L512 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] [2021-08-27 07:26:11,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:26:11,554 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting sll_circular_createErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:11,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:11,554 INFO L82 PathProgramCache]: Analyzing trace with hash 173693975, now seen corresponding path program 1 times [2021-08-27 07:26:11,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:11,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946864286] [2021-08-27 07:26:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:11,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:26:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:11,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:26:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 07:26:11,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:11,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946864286] [2021-08-27 07:26:11,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946864286] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:11,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:26:11,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:26:11,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35506905] [2021-08-27 07:26:11,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:26:11,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:26:11,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:26:11,713 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:26:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:12,093 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2021-08-27 07:26:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:26:12,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-08-27 07:26:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:12,095 INFO L225 Difference]: With dead ends: 114 [2021-08-27 07:26:12,095 INFO L226 Difference]: Without dead ends: 114 [2021-08-27 07:26:12,096 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:26:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-27 07:26:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2021-08-27 07:26:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 79 states have internal predecessors, (86), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 07:26:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-08-27 07:26:12,101 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 28 [2021-08-27 07:26:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:12,101 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-08-27 07:26:12,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:26:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-08-27 07:26:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:26:12,102 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:12,102 INFO L512 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] [2021-08-27 07:26:12,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:26:12,103 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting sll_circular_createErr1REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash 173693976, now seen corresponding path program 1 times [2021-08-27 07:26:12,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:12,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035634512] [2021-08-27 07:26:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:12,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:26:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:26:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:26:12,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:12,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035634512] [2021-08-27 07:26:12,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035634512] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:12,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:26:12,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:26:12,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136449266] [2021-08-27 07:26:12,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:26:12,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:12,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:26:12,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:26:12,276 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:26:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:12,663 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-08-27 07:26:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:26:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-08-27 07:26:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:12,665 INFO L225 Difference]: With dead ends: 113 [2021-08-27 07:26:12,665 INFO L226 Difference]: Without dead ends: 113 [2021-08-27 07:26:12,665 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 98.5ms TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:26:12,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-27 07:26:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2021-08-27 07:26:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 78 states have internal predecessors, (85), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 07:26:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2021-08-27 07:26:12,677 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 28 [2021-08-27 07:26:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:12,677 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2021-08-27 07:26:12,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:26:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2021-08-27 07:26:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:26:12,683 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:12,683 INFO L512 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] [2021-08-27 07:26:12,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:26:12,683 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting sll_circular_createErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash -918257581, now seen corresponding path program 1 times [2021-08-27 07:26:12,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:12,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117078942] [2021-08-27 07:26:12,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:12,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:26:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:26:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 07:26:12,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:12,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117078942] [2021-08-27 07:26:12,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117078942] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:12,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712481895] [2021-08-27 07:26:12,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:12,943 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:12,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:12,949 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:26:12,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 07:26:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:13,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 07:26:13,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:13,230 INFO L388 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 [2021-08-27 07:26:13,502 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 07:26:13,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2021-08-27 07:26:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:26:13,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712481895] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:13,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:26:13,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-08-27 07:26:13,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808337525] [2021-08-27 07:26:13,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:26:13,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:13,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:26:13,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:26:13,630 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:26:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:14,212 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2021-08-27 07:26:14,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:26:14,212 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-08-27 07:26:14,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:14,213 INFO L225 Difference]: With dead ends: 112 [2021-08-27 07:26:14,213 INFO L226 Difference]: Without dead ends: 112 [2021-08-27 07:26:14,214 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 295.1ms TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:26:14,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-08-27 07:26:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2021-08-27 07:26:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 77 states have internal predecessors, (84), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 07:26:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2021-08-27 07:26:14,218 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 31 [2021-08-27 07:26:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:14,218 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2021-08-27 07:26:14,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:26:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2021-08-27 07:26:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:26:14,219 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:14,219 INFO L512 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] [2021-08-27 07:26:14,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 07:26:14,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-08-27 07:26:14,433 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting sll_circular_createErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash -918257580, now seen corresponding path program 1 times [2021-08-27 07:26:14,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:14,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039377539] [2021-08-27 07:26:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:14,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:14,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:26:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:14,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:26:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 07:26:14,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:14,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039377539] [2021-08-27 07:26:14,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039377539] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:14,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15018891] [2021-08-27 07:26:14,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:14,652 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:14,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:14,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:26:14,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 07:26:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:14,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-27 07:26:14,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:14,875 INFO L388 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 [2021-08-27 07:26:14,880 INFO L388 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 [2021-08-27 07:26:15,211 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 07:26:15,212 INFO L388 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 1 case distinctions, treesize of input 22 treesize of output 24 [2021-08-27 07:26:15,219 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:26:15,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2021-08-27 07:26:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:26:15,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15018891] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:15,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:26:15,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2021-08-27 07:26:15,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62589520] [2021-08-27 07:26:15,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 07:26:15,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 07:26:15,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:26:15,342 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:26:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:16,006 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2021-08-27 07:26:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:26:16,013 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2021-08-27 07:26:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:16,014 INFO L225 Difference]: With dead ends: 111 [2021-08-27 07:26:16,014 INFO L226 Difference]: Without dead ends: 111 [2021-08-27 07:26:16,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 321.8ms TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:26:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-08-27 07:26:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2021-08-27 07:26:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.456140350877193) internal successors, (83), 76 states have internal predecessors, (83), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 07:26:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2021-08-27 07:26:16,018 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 31 [2021-08-27 07:26:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:16,019 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2021-08-27 07:26:16,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:26:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2021-08-27 07:26:16,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 07:26:16,020 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:16,020 INFO L512 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] [2021-08-27 07:26:16,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 07:26:16,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-08-27 07:26:16,235 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting sll_circular_update_atErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1835388011, now seen corresponding path program 1 times [2021-08-27 07:26:16,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:16,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545524418] [2021-08-27 07:26:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:16,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:16,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:16,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:16,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 07:26:16,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:16,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545524418] [2021-08-27 07:26:16,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545524418] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:16,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:26:16,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:26:16,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790615924] [2021-08-27 07:26:16,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:26:16,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:16,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:26:16,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:26:16,450 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:26:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:17,142 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2021-08-27 07:26:17,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:26:17,143 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2021-08-27 07:26:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:17,144 INFO L225 Difference]: With dead ends: 119 [2021-08-27 07:26:17,145 INFO L226 Difference]: Without dead ends: 119 [2021-08-27 07:26:17,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 259.8ms TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:26:17,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-08-27 07:26:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2021-08-27 07:26:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 79 states have internal predecessors, (89), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 07:26:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2021-08-27 07:26:17,150 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 40 [2021-08-27 07:26:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:17,153 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2021-08-27 07:26:17,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:26:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2021-08-27 07:26:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 07:26:17,160 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:17,160 INFO L512 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] [2021-08-27 07:26:17,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:26:17,161 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting sll_circular_update_atErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:17,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1835388012, now seen corresponding path program 1 times [2021-08-27 07:26:17,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:17,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133007184] [2021-08-27 07:26:17,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:17,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:17,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:17,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:17,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:17,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:26:17,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:17,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133007184] [2021-08-27 07:26:17,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133007184] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:17,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:26:17,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:26:17,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669809579] [2021-08-27 07:26:17,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:26:17,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:26:17,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:26:17,511 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:26:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:18,332 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2021-08-27 07:26:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:26:18,332 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2021-08-27 07:26:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:18,334 INFO L225 Difference]: With dead ends: 117 [2021-08-27 07:26:18,334 INFO L226 Difference]: Without dead ends: 117 [2021-08-27 07:26:18,334 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 366.1ms TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:26:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-08-27 07:26:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2021-08-27 07:26:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.45) internal successors, (87), 79 states have internal predecessors, (87), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 07:26:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2021-08-27 07:26:18,337 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 40 [2021-08-27 07:26:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:18,338 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2021-08-27 07:26:18,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:26:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2021-08-27 07:26:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 07:26:18,339 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:18,339 INFO L512 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] [2021-08-27 07:26:18,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:26:18,339 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting sll_circular_destroyErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:18,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1224058359, now seen corresponding path program 1 times [2021-08-27 07:26:18,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:18,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072405172] [2021-08-27 07:26:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:18,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:18,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:18,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:26:18,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:18,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072405172] [2021-08-27 07:26:18,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072405172] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:18,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:26:18,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:26:18,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722857409] [2021-08-27 07:26:18,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:26:18,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:18,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:26:18,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:26:18,445 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:26:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:18,710 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2021-08-27 07:26:18,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:26:18,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2021-08-27 07:26:18,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:18,715 INFO L225 Difference]: With dead ends: 123 [2021-08-27 07:26:18,716 INFO L226 Difference]: Without dead ends: 123 [2021-08-27 07:26:18,716 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.8ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:26:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-27 07:26:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2021-08-27 07:26:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.435483870967742) internal successors, (89), 81 states have internal predecessors, (89), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 07:26:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-08-27 07:26:18,720 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 42 [2021-08-27 07:26:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:18,721 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-08-27 07:26:18,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:26:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-08-27 07:26:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-27 07:26:18,722 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:18,722 INFO L512 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] [2021-08-27 07:26:18,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:26:18,723 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting sll_circular_update_atErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:18,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1182712765, now seen corresponding path program 1 times [2021-08-27 07:26:18,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:18,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101014296] [2021-08-27 07:26:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:18,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:18,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:18,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:18,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:26:18,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:18,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101014296] [2021-08-27 07:26:18,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101014296] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:18,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:26:18,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:26:18,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062377462] [2021-08-27 07:26:18,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:26:18,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:18,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:26:18,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:26:18,857 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:26:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:19,235 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2021-08-27 07:26:19,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:26:19,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-08-27 07:26:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:19,237 INFO L225 Difference]: With dead ends: 128 [2021-08-27 07:26:19,237 INFO L226 Difference]: Without dead ends: 128 [2021-08-27 07:26:19,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 117.1ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:26:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-08-27 07:26:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 102. [2021-08-27 07:26:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 86 states have internal predecessors, (93), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 07:26:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2021-08-27 07:26:19,242 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 43 [2021-08-27 07:26:19,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:19,242 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2021-08-27 07:26:19,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:26:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2021-08-27 07:26:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:26:19,244 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:19,244 INFO L512 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] [2021-08-27 07:26:19,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:26:19,244 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting sll_circular_get_data_atErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash 27146876, now seen corresponding path program 1 times [2021-08-27 07:26:19,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:19,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729951589] [2021-08-27 07:26:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:19,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:19,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:19,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:19,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:19,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:19,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:26:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 07:26:19,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:19,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729951589] [2021-08-27 07:26:19,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729951589] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:19,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:26:19,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:26:19,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635913900] [2021-08-27 07:26:19,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:26:19,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:19,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:26:19,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:26:19,479 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:26:20,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:20,193 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2021-08-27 07:26:20,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:26:20,194 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2021-08-27 07:26:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:20,196 INFO L225 Difference]: With dead ends: 130 [2021-08-27 07:26:20,196 INFO L226 Difference]: Without dead ends: 130 [2021-08-27 07:26:20,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 254.3ms TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:26:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-08-27 07:26:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2021-08-27 07:26:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.434782608695652) internal successors, (99), 89 states have internal predecessors, (99), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 07:26:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2021-08-27 07:26:20,202 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 50 [2021-08-27 07:26:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:20,203 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2021-08-27 07:26:20,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:26:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2021-08-27 07:26:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:26:20,204 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:20,205 INFO L512 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] [2021-08-27 07:26:20,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:26:20,205 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting sll_circular_get_data_atErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash 27146877, now seen corresponding path program 1 times [2021-08-27 07:26:20,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:20,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606672972] [2021-08-27 07:26:20,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:20,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:20,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:20,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:20,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:20,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:26:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:26:20,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:20,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606672972] [2021-08-27 07:26:20,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606672972] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:20,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656009977] [2021-08-27 07:26:20,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:20,338 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:20,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:20,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:26:20,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 07:26:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:20,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:26:20,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:26:20,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656009977] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:20,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:26:20,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2021-08-27 07:26:20,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029724987] [2021-08-27 07:26:20,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:26:20,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:20,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:26:20,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:26:20,765 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 6 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-08-27 07:26:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:21,074 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2021-08-27 07:26:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:26:21,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 6 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 50 [2021-08-27 07:26:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:21,076 INFO L225 Difference]: With dead ends: 133 [2021-08-27 07:26:21,077 INFO L226 Difference]: Without dead ends: 133 [2021-08-27 07:26:21,078 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 106.3ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:26:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-27 07:26:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2021-08-27 07:26:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 94 states have internal predecessors, (106), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:26:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2021-08-27 07:26:21,083 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 50 [2021-08-27 07:26:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:21,084 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2021-08-27 07:26:21,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 6 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-08-27 07:26:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2021-08-27 07:26:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:26:21,085 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:21,085 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:21,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 07:26:21,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:21,301 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting sll_circular_update_atErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:21,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:21,301 INFO L82 PathProgramCache]: Analyzing trace with hash 310228175, now seen corresponding path program 1 times [2021-08-27 07:26:21,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:21,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775724583] [2021-08-27 07:26:21,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:21,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:21,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:21,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:21,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:21,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:26:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:26:21,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:21,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775724583] [2021-08-27 07:26:21,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775724583] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:21,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652597212] [2021-08-27 07:26:21,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:21,866 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:21,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:21,867 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:26:21,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 07:26:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:22,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 66 conjunts are in the unsatisfiable core [2021-08-27 07:26:22,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:22,111 INFO L388 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 [2021-08-27 07:26:22,305 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:26:22,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:26:22,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:26:22,463 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:26:22,464 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2021-08-27 07:26:22,768 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:26:22,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2021-08-27 07:26:32,833 INFO L354 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2021-08-27 07:26:32,834 INFO L388 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 51 treesize of output 39 [2021-08-27 07:26:33,405 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-27 07:26:33,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 28 [2021-08-27 07:26:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:26:33,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652597212] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:33,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:26:33,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 37 [2021-08-27 07:26:33,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044921548] [2021-08-27 07:26:33,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-27 07:26:33,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:33,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-27 07:26:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1302, Unknown=17, NotChecked=0, Total=1406 [2021-08-27 07:26:33,421 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 38 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 27 states have internal predecessors, (61), 6 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 07:26:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:38,876 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2021-08-27 07:26:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 07:26:38,877 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 27 states have internal predecessors, (61), 6 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 51 [2021-08-27 07:26:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:38,880 INFO L225 Difference]: With dead ends: 209 [2021-08-27 07:26:38,880 INFO L226 Difference]: Without dead ends: 209 [2021-08-27 07:26:38,881 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 14425.8ms TimeCoverageRelationStatistics Valid=321, Invalid=3202, Unknown=17, NotChecked=0, Total=3540 [2021-08-27 07:26:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-08-27 07:26:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 146. [2021-08-27 07:26:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 122 states have internal predecessors, (139), 13 states have call successors, (13), 10 states have call predecessors, (13), 11 states have return successors, (15), 13 states have call predecessors, (15), 12 states have call successors, (15) [2021-08-27 07:26:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2021-08-27 07:26:38,886 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 51 [2021-08-27 07:26:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:38,886 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2021-08-27 07:26:38,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 27 states have internal predecessors, (61), 6 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 07:26:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2021-08-27 07:26:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:26:38,887 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:38,887 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:38,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 07:26:39,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:39,088 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting sll_circular_update_atErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:26:39,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:39,088 INFO L82 PathProgramCache]: Analyzing trace with hash 310228176, now seen corresponding path program 1 times [2021-08-27 07:26:39,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:39,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084227762] [2021-08-27 07:26:39,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:39,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:39,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:39,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:39,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:39,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:26:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:26:40,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:40,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084227762] [2021-08-27 07:26:40,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084227762] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:40,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787794018] [2021-08-27 07:26:40,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:40,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:40,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:40,006 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:26:40,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 07:26:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:40,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 92 conjunts are in the unsatisfiable core [2021-08-27 07:26:40,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:40,367 INFO L388 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 [2021-08-27 07:26:40,374 INFO L388 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 [2021-08-27 07:26:40,839 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:26:40,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:26:40,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 07:26:40,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:26:41,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:26:41,204 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:26:41,205 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 45 [2021-08-27 07:26:41,217 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 07:26:41,217 INFO L388 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 1 case distinctions, treesize of input 55 treesize of output 50 [2021-08-27 07:26:41,697 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:26:41,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 35 [2021-08-27 07:26:41,705 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:26:41,705 INFO L388 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 29 treesize of output 21 [2021-08-27 07:26:44,729 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 07:26:44,730 INFO L388 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 88 treesize of output 66 [2021-08-27 07:26:44,755 INFO L354 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2021-08-27 07:26:44,755 INFO L388 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 69 treesize of output 56 [2021-08-27 07:26:45,158 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:26:45,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 45 [2021-08-27 07:26:45,163 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:26:45,163 INFO L388 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 36 treesize of output 24 [2021-08-27 07:26:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 07:26:45,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787794018] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:45,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:26:45,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 48 [2021-08-27 07:26:45,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903679007] [2021-08-27 07:26:45,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-08-27 07:26:45,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:45,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-08-27 07:26:45,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2217, Unknown=2, NotChecked=0, Total=2352 [2021-08-27 07:26:45,339 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand has 49 states, 48 states have (on average 1.5625) internal successors, (75), 36 states have internal predecessors, (75), 6 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:27:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:27:07,420 INFO L93 Difference]: Finished difference Result 302 states and 343 transitions. [2021-08-27 07:27:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-27 07:27:07,421 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.5625) internal successors, (75), 36 states have internal predecessors, (75), 6 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) Word has length 51 [2021-08-27 07:27:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:27:07,423 INFO L225 Difference]: With dead ends: 302 [2021-08-27 07:27:07,423 INFO L226 Difference]: Without dead ends: 302 [2021-08-27 07:27:07,424 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 13442.2ms TimeCoverageRelationStatistics Valid=467, Invalid=5366, Unknown=19, NotChecked=0, Total=5852 [2021-08-27 07:27:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-08-27 07:27:07,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 160. [2021-08-27 07:27:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 134 states have internal predecessors, (153), 14 states have call successors, (14), 11 states have call predecessors, (14), 13 states have return successors, (18), 14 states have call predecessors, (18), 13 states have call successors, (18) [2021-08-27 07:27:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 185 transitions. [2021-08-27 07:27:07,431 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 185 transitions. Word has length 51 [2021-08-27 07:27:07,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:27:07,432 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 185 transitions. [2021-08-27 07:27:07,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.5625) internal successors, (75), 36 states have internal predecessors, (75), 6 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:27:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 185 transitions. [2021-08-27 07:27:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 07:27:07,433 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:27:07,433 INFO L512 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] [2021-08-27 07:27:07,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 07:27:07,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-27 07:27:07,659 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting sll_circular_update_atErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:27:07,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:27:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash -760362657, now seen corresponding path program 2 times [2021-08-27 07:27:07,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:27:07,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356503179] [2021-08-27 07:27:07,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:27:07,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:27:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:07,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:27:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:07,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:27:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:07,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:27:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:07,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:27:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:07,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:27:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:27:07,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:27:07,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356503179] [2021-08-27 07:27:07,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356503179] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:27:07,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912185311] [2021-08-27 07:27:07,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 07:27:07,811 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:27:07,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:27:07,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:27:07,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 07:27:08,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 07:27:08,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 07:27:08,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 07:27:08,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:27:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-27 07:27:08,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912185311] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:27:08,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:27:08,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2021-08-27 07:27:08,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832381910] [2021-08-27 07:27:08,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:27:08,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:27:08,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:27:08,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:27:08,366 INFO L87 Difference]: Start difference. First operand 160 states and 185 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:27:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:27:08,814 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2021-08-27 07:27:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:27:08,822 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2021-08-27 07:27:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:27:08,824 INFO L225 Difference]: With dead ends: 177 [2021-08-27 07:27:08,824 INFO L226 Difference]: Without dead ends: 177 [2021-08-27 07:27:08,824 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 211.3ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:27:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-27 07:27:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2021-08-27 07:27:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 110 states have (on average 1.309090909090909) internal successors, (144), 128 states have internal predecessors, (144), 14 states have call successors, (14), 11 states have call predecessors, (14), 12 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2021-08-27 07:27:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2021-08-27 07:27:08,834 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 54 [2021-08-27 07:27:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:27:08,834 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2021-08-27 07:27:08,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:27:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2021-08-27 07:27:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-27 07:27:08,835 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:27:08,836 INFO L512 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] [2021-08-27 07:27:08,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 07:27:09,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-08-27 07:27:09,049 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting sll_circular_get_data_atErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:27:09,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:27:09,049 INFO L82 PathProgramCache]: Analyzing trace with hash 827280497, now seen corresponding path program 2 times [2021-08-27 07:27:09,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:27:09,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110645541] [2021-08-27 07:27:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:27:09,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:27:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:09,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:27:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:09,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:27:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:09,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:27:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:09,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:27:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:09,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:27:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:09,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:27:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-27 07:27:09,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:27:09,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110645541] [2021-08-27 07:27:09,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110645541] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:27:09,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315857815] [2021-08-27 07:27:09,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 07:27:09,190 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:27:09,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:27:09,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:27:09,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 07:27:09,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-27 07:27:09,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 07:27:09,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 40 conjunts are in the unsatisfiable core [2021-08-27 07:27:09,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:27:09,620 INFO L388 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 [2021-08-27 07:27:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-27 07:27:10,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315857815] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:27:10,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 07:27:10,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 20 [2021-08-27 07:27:10,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906309114] [2021-08-27 07:27:10,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:27:10,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:27:10,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:27:10,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:27:10,119 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:27:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:27:10,399 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2021-08-27 07:27:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:27:10,399 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-08-27 07:27:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:27:10,400 INFO L225 Difference]: With dead ends: 159 [2021-08-27 07:27:10,400 INFO L226 Difference]: Without dead ends: 159 [2021-08-27 07:27:10,400 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 349.1ms TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:27:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-27 07:27:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 154. [2021-08-27 07:27:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 110 states have (on average 1.290909090909091) internal successors, (142), 128 states have internal predecessors, (142), 14 states have call successors, (14), 11 states have call predecessors, (14), 12 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2021-08-27 07:27:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 171 transitions. [2021-08-27 07:27:10,405 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 171 transitions. Word has length 58 [2021-08-27 07:27:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:27:10,406 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 171 transitions. [2021-08-27 07:27:10,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:27:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 171 transitions. [2021-08-27 07:27:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 07:27:10,407 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:27:10,407 INFO L512 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] [2021-08-27 07:27:10,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 07:27:10,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:27:10,625 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting sll_circular_get_data_atErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:27:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:27:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash 992697175, now seen corresponding path program 1 times [2021-08-27 07:27:10,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:27:10,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922499438] [2021-08-27 07:27:10,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:27:10,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:27:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:10,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:27:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:10,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:27:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:10,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:27:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:10,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:27:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:10,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:27:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:10,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:27:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-27 07:27:10,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:27:10,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922499438] [2021-08-27 07:27:10,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922499438] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:27:10,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:27:10,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:27:10,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231932885] [2021-08-27 07:27:10,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:27:10,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:27:10,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:27:10,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:27:10,768 INFO L87 Difference]: Start difference. First operand 154 states and 171 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:27:11,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:27:11,123 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2021-08-27 07:27:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:27:11,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2021-08-27 07:27:11,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:27:11,125 INFO L225 Difference]: With dead ends: 181 [2021-08-27 07:27:11,125 INFO L226 Difference]: Without dead ends: 181 [2021-08-27 07:27:11,125 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 116.3ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:27:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-08-27 07:27:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2021-08-27 07:27:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 133 states have internal predecessors, (147), 14 states have call successors, (14), 12 states have call predecessors, (14), 13 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2021-08-27 07:27:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2021-08-27 07:27:11,131 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 61 [2021-08-27 07:27:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:27:11,133 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2021-08-27 07:27:11,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:27:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2021-08-27 07:27:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-27 07:27:11,134 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:27:11,134 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-08-27 07:27:11,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:27:11,134 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting sll_circular_update_atErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:27:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:27:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash 675898859, now seen corresponding path program 3 times [2021-08-27 07:27:11,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:27:11,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109862424] [2021-08-27 07:27:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:27:11,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:27:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:11,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:27:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:11,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:27:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:11,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:27:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:11,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:27:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:11,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:27:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:11,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:27:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 07:27:11,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:27:11,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109862424] [2021-08-27 07:27:11,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109862424] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:27:11,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672145141] [2021-08-27 07:27:11,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 07:27:11,274 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:27:11,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:27:11,275 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:27:11,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 07:27:11,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-27 07:27:11,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 07:27:11,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 07:27:11,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:27:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-27 07:27:12,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672145141] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:27:12,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:27:12,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2021-08-27 07:27:12,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528097147] [2021-08-27 07:27:12,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:27:12,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:27:12,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:27:12,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:27:12,050 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:27:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:27:12,572 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2021-08-27 07:27:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:27:12,573 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 62 [2021-08-27 07:27:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:27:12,573 INFO L225 Difference]: With dead ends: 171 [2021-08-27 07:27:12,573 INFO L226 Difference]: Without dead ends: 171 [2021-08-27 07:27:12,574 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 229.6ms TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:27:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-27 07:27:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 143. [2021-08-27 07:27:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 119 states have internal predecessors, (127), 13 states have call successors, (13), 11 states have call predecessors, (13), 11 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2021-08-27 07:27:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2021-08-27 07:27:12,578 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 62 [2021-08-27 07:27:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:27:12,578 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2021-08-27 07:27:12,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:27:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2021-08-27 07:27:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:27:12,579 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:27:12,579 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:27:12,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 07:27:12,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:27:12,793 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting sll_circular_update_atErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:27:12,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:27:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2095820899, now seen corresponding path program 4 times [2021-08-27 07:27:12,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:27:12,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137243287] [2021-08-27 07:27:12,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:27:12,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:27:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:12,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:27:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:12,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:27:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:12,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:27:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:12,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:27:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:12,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-27 07:27:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:12,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-08-27 07:27:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-08-27 07:27:12,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:27:12,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137243287] [2021-08-27 07:27:12,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137243287] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:27:12,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116816513] [2021-08-27 07:27:12,933 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 07:27:12,934 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:27:12,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:27:12,935 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:27:12,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-27 07:27:13,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 07:27:13,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 07:27:13,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 07:27:13,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:27:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-08-27 07:27:13,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116816513] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:27:13,596 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:27:13,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2021-08-27 07:27:13,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842664516] [2021-08-27 07:27:13,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:27:13,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:27:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:27:13,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:27:13,597 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand has 11 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 7 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:27:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:27:13,926 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2021-08-27 07:27:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:27:13,926 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 7 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 63 [2021-08-27 07:27:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:27:13,927 INFO L225 Difference]: With dead ends: 140 [2021-08-27 07:27:13,927 INFO L226 Difference]: Without dead ends: 131 [2021-08-27 07:27:13,927 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 143.1ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:27:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-27 07:27:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2021-08-27 07:27:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 93 states have internal predecessors, (99), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:27:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2021-08-27 07:27:13,931 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 63 [2021-08-27 07:27:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:27:13,931 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2021-08-27 07:27:13,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 7 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:27:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2021-08-27 07:27:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 07:27:13,932 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:27:13,932 INFO L512 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] [2021-08-27 07:27:13,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-27 07:27:14,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:27:14,145 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:27:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:27:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1237454384, now seen corresponding path program 1 times [2021-08-27 07:27:14,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:27:14,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616655289] [2021-08-27 07:27:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:27:14,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:27:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:14,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:27:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:27:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:14,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:27:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:14,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:27:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:27:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:27:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:14,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-27 07:27:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-27 07:27:14,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:27:14,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616655289] [2021-08-27 07:27:14,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616655289] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:27:14,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608247900] [2021-08-27 07:27:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:27:14,312 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:27:14,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:27:14,313 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:27:14,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 07:27:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:14,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 07:27:14,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:27:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-27 07:27:15,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608247900] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:27:15,047 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 07:27:15,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2021-08-27 07:27:15,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872420393] [2021-08-27 07:27:15,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:27:15,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:27:15,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:27:15,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:27:15,048 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 07:27:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:27:15,100 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2021-08-27 07:27:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:27:15,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2021-08-27 07:27:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:27:15,101 INFO L225 Difference]: With dead ends: 117 [2021-08-27 07:27:15,101 INFO L226 Difference]: Without dead ends: 114 [2021-08-27 07:27:15,101 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 81.0ms TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:27:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-27 07:27:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2021-08-27 07:27:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 93 states have internal predecessors, (98), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:27:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2021-08-27 07:27:15,104 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 64 [2021-08-27 07:27:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:27:15,104 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2021-08-27 07:27:15,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 07:27:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2021-08-27 07:27:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 07:27:15,105 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:27:15,105 INFO L512 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, 1, 1, 1] [2021-08-27 07:27:15,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-08-27 07:27:15,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-08-27 07:27:15,313 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:27:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:27:15,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1206656096, now seen corresponding path program 1 times [2021-08-27 07:27:15,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:27:15,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497247612] [2021-08-27 07:27:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:27:15,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:27:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:15,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:27:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:15,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:27:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:15,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:27:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:15,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:27:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:16,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:27:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:27:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:16,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:27:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 07:27:16,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:27:16,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497247612] [2021-08-27 07:27:16,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497247612] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:27:16,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958946810] [2021-08-27 07:27:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:27:16,485 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:27:16,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:27:16,489 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:27:16,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 07:27:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:16,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 103 conjunts are in the unsatisfiable core [2021-08-27 07:27:16,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:27:17,035 INFO L388 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 [2021-08-27 07:27:17,220 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:27:17,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:27:17,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:27:17,471 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:27:17,472 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2021-08-27 07:27:18,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 07:27:18,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 07:27:18,130 INFO L354 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2021-08-27 07:27:18,130 INFO L388 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 25 [2021-08-27 07:27:19,158 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int) (sll_circular_update_at_~data Int)) (= |c_#memory_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_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ sll_circular_update_at_~head.offset 4) sll_circular_update_at_~data))))) is different from true [2021-08-27 07:27:19,186 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:27:19,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 33 [2021-08-27 07:27:19,200 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-08-27 07:27:19,201 INFO L388 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 1 case distinctions, treesize of input 27 treesize of output 26 [2021-08-27 07:27:19,800 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-08-27 07:27:19,801 INFO L388 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 40 treesize of output 22 [2021-08-27 07:27:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-08-27 07:27:19,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958946810] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:27:19,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:27:19,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 63 [2021-08-27 07:27:19,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447283836] [2021-08-27 07:27:19,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-08-27 07:27:19,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:27:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-08-27 07:27:19,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3593, Unknown=1, NotChecked=120, Total=3906 [2021-08-27 07:27:19,874 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 63 states, 58 states have (on average 1.603448275862069) internal successors, (93), 50 states have internal predecessors, (93), 10 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (12), 12 states have call predecessors, (12), 10 states have call successors, (12) [2021-08-27 07:27:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:27:28,007 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2021-08-27 07:27:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-27 07:27:28,007 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 58 states have (on average 1.603448275862069) internal successors, (93), 50 states have internal predecessors, (93), 10 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (12), 12 states have call predecessors, (12), 10 states have call successors, (12) Word has length 67 [2021-08-27 07:27:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:27:28,008 INFO L225 Difference]: With dead ends: 135 [2021-08-27 07:27:28,008 INFO L226 Difference]: Without dead ends: 135 [2021-08-27 07:27:28,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 8911.2ms TimeCoverageRelationStatistics Valid=477, Invalid=7172, Unknown=11, NotChecked=172, Total=7832 [2021-08-27 07:27:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-27 07:27:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 112. [2021-08-27 07:27:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 93 states have internal predecessors, (97), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:27:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2021-08-27 07:27:28,014 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 67 [2021-08-27 07:27:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:27:28,014 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2021-08-27 07:27:28,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 58 states have (on average 1.603448275862069) internal successors, (93), 50 states have internal predecessors, (93), 10 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (12), 12 states have call predecessors, (12), 10 states have call successors, (12) [2021-08-27 07:27:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2021-08-27 07:27:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-27 07:27:28,015 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:27:28,015 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:27:28,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-27 07:27:28,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-27 07:27:28,239 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting sll_circular_get_data_atErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:27:28,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:27:28,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2112045542, now seen corresponding path program 1 times [2021-08-27 07:27:28,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:27:28,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250416840] [2021-08-27 07:27:28,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:27:28,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:27:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:28,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:27:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:27:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:27:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:28,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:27:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:28,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:27:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:28,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:27:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:27:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 07:27:29,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:27:29,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250416840] [2021-08-27 07:27:29,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250416840] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:27:29,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809054304] [2021-08-27 07:27:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:27:29,008 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:27:29,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:27:29,017 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:27:29,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-27 07:27:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:27:29,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 76 conjunts are in the unsatisfiable core [2021-08-27 07:27:29,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:27:29,711 INFO L388 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 [2021-08-27 07:27:29,868 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:27:29,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:27:29,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:27:30,066 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:27:30,067 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2021-08-27 07:27:30,377 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:27:30,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2021-08-27 07:27:41,579 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 07:27:41,579 INFO L388 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 51 treesize of output 33 [2021-08-27 07:27:41,666 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:27:41,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2021-08-27 07:27:58,571 INFO L354 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2021-08-27 07:27:58,571 INFO L388 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 60 treesize of output 51 [2021-08-27 07:28:01,586 INFO L388 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 13 [2021-08-27 07:28:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 07:28:01,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809054304] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:28:01,596 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:28:01,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 50 [2021-08-27 07:28:01,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750544975] [2021-08-27 07:28:01,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-08-27 07:28:01,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:28:01,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-08-27 07:28:01,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2356, Unknown=40, NotChecked=0, Total=2550 [2021-08-27 07:28:01,597 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 51 states, 50 states have (on average 2.06) internal successors, (103), 39 states have internal predecessors, (103), 6 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2021-08-27 07:29:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:29:13,195 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2021-08-27 07:29:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 07:29:13,195 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.06) internal successors, (103), 39 states have internal predecessors, (103), 6 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) Word has length 75 [2021-08-27 07:29:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:29:13,196 INFO L225 Difference]: With dead ends: 144 [2021-08-27 07:29:13,196 INFO L226 Difference]: Without dead ends: 144 [2021-08-27 07:29:13,198 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 42002.0ms TimeCoverageRelationStatistics Valid=470, Invalid=5032, Unknown=48, NotChecked=0, Total=5550 [2021-08-27 07:29:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-27 07:29:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2021-08-27 07:29:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 97 states have internal predecessors, (104), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:29:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2021-08-27 07:29:13,201 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 75 [2021-08-27 07:29:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:29:13,202 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2021-08-27 07:29:13,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.06) internal successors, (103), 39 states have internal predecessors, (103), 6 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2021-08-27 07:29:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2021-08-27 07:29:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-27 07:29:13,203 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:29:13,203 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:29:13,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-27 07:29:13,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-08-27 07:29:13,409 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting sll_circular_get_data_atErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:29:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:29:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2112045541, now seen corresponding path program 1 times [2021-08-27 07:29:13,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:29:13,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979973346] [2021-08-27 07:29:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:29:13,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:29:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:13,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:29:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:13,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:29:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:13,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:29:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:13,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:29:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:29:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:29:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:14,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:29:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 07:29:14,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:29:14,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979973346] [2021-08-27 07:29:14,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979973346] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:29:14,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812734336] [2021-08-27 07:29:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:29:14,490 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:29:14,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:29:14,499 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:29:14,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-27 07:29:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:15,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 98 conjunts are in the unsatisfiable core [2021-08-27 07:29:15,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:29:15,160 INFO L388 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 [2021-08-27 07:29:15,164 INFO L388 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 [2021-08-27 07:29:15,561 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 07:29:15,561 INFO L388 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 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 07:29:15,575 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:29:15,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:29:15,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:29:15,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:29:15,849 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:29:15,850 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 45 [2021-08-27 07:29:15,862 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 07:29:15,863 INFO L388 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 1 case distinctions, treesize of input 55 treesize of output 50 [2021-08-27 07:29:16,230 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:29:16,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 35 [2021-08-27 07:29:16,236 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:29:16,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2021-08-27 07:29:19,539 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 07:29:19,540 INFO L388 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 88 treesize of output 66 [2021-08-27 07:29:19,559 INFO L354 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2021-08-27 07:29:19,560 INFO L388 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 69 treesize of output 56 [2021-08-27 07:29:19,714 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:29:19,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 35 [2021-08-27 07:29:19,720 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:29:19,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2021-08-27 07:29:31,783 INFO L354 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2021-08-27 07:29:31,784 INFO L388 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 109 treesize of output 84 [2021-08-27 07:29:31,810 INFO L354 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2021-08-27 07:29:31,810 INFO L388 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 65 [2021-08-27 07:29:32,455 INFO L388 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 44 treesize of output 32 [2021-08-27 07:29:32,458 INFO L388 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 29 treesize of output 21 [2021-08-27 07:29:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 07:29:32,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812734336] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:29:32,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:29:32,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 59 [2021-08-27 07:29:32,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948163729] [2021-08-27 07:29:32,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-08-27 07:29:32,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:29:32,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-08-27 07:29:32,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3340, Unknown=9, NotChecked=0, Total=3540 [2021-08-27 07:29:32,612 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 60 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 47 states have internal predecessors, (113), 8 states have call successors, (16), 9 states have call predecessors, (16), 12 states have return successors, (13), 11 states have call predecessors, (13), 8 states have call successors, (13) [2021-08-27 07:29:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:29:55,233 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2021-08-27 07:29:55,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 07:29:55,233 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 47 states have internal predecessors, (113), 8 states have call successors, (16), 9 states have call predecessors, (16), 12 states have return successors, (13), 11 states have call predecessors, (13), 8 states have call successors, (13) Word has length 75 [2021-08-27 07:29:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:29:55,234 INFO L225 Difference]: With dead ends: 142 [2021-08-27 07:29:55,234 INFO L226 Difference]: Without dead ends: 142 [2021-08-27 07:29:55,236 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 20225.7ms TimeCoverageRelationStatistics Valid=486, Invalid=6477, Unknown=9, NotChecked=0, Total=6972 [2021-08-27 07:29:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-27 07:29:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 115. [2021-08-27 07:29:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 96 states have internal predecessors, (101), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:29:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2021-08-27 07:29:55,239 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 75 [2021-08-27 07:29:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:29:55,239 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2021-08-27 07:29:55,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 47 states have internal predecessors, (113), 8 states have call successors, (16), 9 states have call predecessors, (16), 12 states have return successors, (13), 11 states have call predecessors, (13), 8 states have call successors, (13) [2021-08-27 07:29:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2021-08-27 07:29:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-27 07:29:55,240 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:29:55,240 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:29:55,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-27 07:29:55,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-08-27 07:29:55,445 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:29:55,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:29:55,446 INFO L82 PathProgramCache]: Analyzing trace with hash -32108403, now seen corresponding path program 1 times [2021-08-27 07:29:55,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:29:55,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077730848] [2021-08-27 07:29:55,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:29:55,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:29:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:55,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:29:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:55,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:29:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:29:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:29:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:29:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:29:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:55,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:29:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:55,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:29:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 07:29:55,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:29:55,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077730848] [2021-08-27 07:29:55,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077730848] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:29:55,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851890175] [2021-08-27 07:29:55,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:29:55,571 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:29:55,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:29:55,572 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:29:55,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-27 07:29:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:56,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 07:29:56,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:29:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 07:29:56,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851890175] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:29:56,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 07:29:56,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2021-08-27 07:29:56,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614177672] [2021-08-27 07:29:56,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:29:56,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:29:56,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:29:56,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:29:56,514 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:29:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:29:56,560 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2021-08-27 07:29:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:29:56,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 78 [2021-08-27 07:29:56,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:29:56,561 INFO L225 Difference]: With dead ends: 119 [2021-08-27 07:29:56,561 INFO L226 Difference]: Without dead ends: 115 [2021-08-27 07:29:56,569 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 73.2ms TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:29:56,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-27 07:29:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-08-27 07:29:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 96 states have internal predecessors, (100), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:29:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2021-08-27 07:29:56,573 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 78 [2021-08-27 07:29:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:29:56,573 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2021-08-27 07:29:56,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:29:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2021-08-27 07:29:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-27 07:29:56,574 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:29:56,574 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 07:29:56,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-27 07:29:56,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:29:56,789 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting sll_circular_get_data_atErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:29:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:29:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1323929965, now seen corresponding path program 2 times [2021-08-27 07:29:56,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:29:56,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791043994] [2021-08-27 07:29:56,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:29:56,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:29:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:56,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:29:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:56,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:29:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:56,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:29:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:29:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:29:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:56,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:29:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:29:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-27 07:29:56,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:29:56,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791043994] [2021-08-27 07:29:56,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791043994] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:29:56,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321440633] [2021-08-27 07:29:56,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 07:29:56,920 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:29:56,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:29:56,921 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:29:56,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-27 07:29:57,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 07:29:57,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 07:29:57,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 07:29:57,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:29:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 07:29:57,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321440633] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:29:57,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:29:57,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2021-08-27 07:29:57,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221693547] [2021-08-27 07:29:57,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:29:57,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:29:57,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:29:57,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:29:57,966 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:29:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:29:58,371 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2021-08-27 07:29:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:29:58,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2021-08-27 07:29:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:29:58,372 INFO L225 Difference]: With dead ends: 125 [2021-08-27 07:29:58,372 INFO L226 Difference]: Without dead ends: 125 [2021-08-27 07:29:58,372 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 198.5ms TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:29:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-27 07:29:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2021-08-27 07:29:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 87 states have internal predecessors, (89), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:29:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2021-08-27 07:29:58,375 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 78 [2021-08-27 07:29:58,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:29:58,375 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2021-08-27 07:29:58,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:29:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2021-08-27 07:29:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-27 07:29:58,376 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:29:58,376 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:29:58,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-08-27 07:29:58,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-08-27 07:29:58,581 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:29:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:29:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash -841344934, now seen corresponding path program 1 times [2021-08-27 07:29:58,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:29:58,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502972043] [2021-08-27 07:29:58,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:29:58,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:29:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:29:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:58,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:29:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:29:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:59,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:29:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:59,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:29:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:59,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:29:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:29:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:59,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:29:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 07:29:59,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:29:59,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502972043] [2021-08-27 07:29:59,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502972043] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:29:59,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471213091] [2021-08-27 07:29:59,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:29:59,897 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:29:59,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:29:59,898 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:29:59,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-27 07:30:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:30:00,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 108 conjunts are in the unsatisfiable core [2021-08-27 07:30:00,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:30:00,739 INFO L388 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 [2021-08-27 07:30:01,037 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:30:01,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:30:01,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:30:01,236 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:30:01,236 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2021-08-27 07:30:02,288 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (= |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))))) (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset))) is different from true [2021-08-27 07:30:02,336 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 07:30:02,336 INFO L388 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 42 treesize of output 28 [2021-08-27 07:30:02,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 17 [2021-08-27 07:30:02,843 INFO L354 Elim1Store]: treesize reduction 86, result has 22.5 percent of original size [2021-08-27 07:30:02,843 INFO L388 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 117 treesize of output 100 [2021-08-27 07:30:02,853 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-08-27 07:30:02,853 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 74 [2021-08-27 07:30:05,041 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_21 Int) (v_main_~s~0.offset_BEFORE_CALL_21 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_21 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_21) v_main_~s~0.offset_BEFORE_CALL_21)))) is different from true [2021-08-27 07:30:07,331 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_22 Int) (v_main_~s~0.offset_BEFORE_CALL_22 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_22) v_main_~s~0.offset_BEFORE_CALL_22) v_main_~s~0.base_BEFORE_CALL_22))) is different from true [2021-08-27 07:30:21,883 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 07:30:21,883 INFO L388 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 51 treesize of output 47 [2021-08-27 07:30:21,886 INFO L388 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 47 treesize of output 39 [2021-08-27 07:30:21,887 INFO L388 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 39 treesize of output 27 [2021-08-27 07:30:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-08-27 07:30:21,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471213091] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:30:21,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:30:21,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 73 [2021-08-27 07:30:21,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863735815] [2021-08-27 07:30:21,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2021-08-27 07:30:21,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:30:21,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-08-27 07:30:21,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=4652, Unknown=5, NotChecked=414, Total=5256 [2021-08-27 07:30:21,924 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand has 73 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 59 states have internal predecessors, (121), 11 states have call successors, (17), 9 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2021-08-27 07:30:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:30:58,213 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2021-08-27 07:30:58,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-27 07:30:58,214 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 59 states have internal predecessors, (121), 11 states have call successors, (17), 9 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) Word has length 81 [2021-08-27 07:30:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:30:58,214 INFO L225 Difference]: With dead ends: 123 [2021-08-27 07:30:58,214 INFO L226 Difference]: Without dead ends: 123 [2021-08-27 07:30:58,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 55084.7ms TimeCoverageRelationStatistics Valid=500, Invalid=10009, Unknown=9, NotChecked=612, Total=11130 [2021-08-27 07:30:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-27 07:30:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2021-08-27 07:30:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.16) internal successors, (87), 85 states have internal predecessors, (87), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:30:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2021-08-27 07:30:58,219 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 81 [2021-08-27 07:30:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:30:58,219 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2021-08-27 07:30:58,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 59 states have internal predecessors, (121), 11 states have call successors, (17), 9 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2021-08-27 07:30:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2021-08-27 07:30:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-27 07:30:58,220 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:30:58,220 INFO L512 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] [2021-08-27 07:30:58,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-27 07:30:58,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-27 07:30:58,420 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting sll_circular_destroyErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:30:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:30:58,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1153762942, now seen corresponding path program 1 times [2021-08-27 07:30:58,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:30:58,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697905476] [2021-08-27 07:30:58,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:30:58,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:30:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:30:58,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:30:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:30:58,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:30:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:30:58,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:30:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:30:58,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:30:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:30:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:30:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:30:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:30:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:30:58,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:30:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:30:58,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:30:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:30:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-08-27 07:30:58,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:30:58,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697905476] [2021-08-27 07:30:58,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697905476] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:30:58,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708421374] [2021-08-27 07:30:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:30:58,559 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:30:58,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:30:58,561 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:30:58,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-27 07:30:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:30:59,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 07:30:59,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:30:59,534 INFO L388 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 [2021-08-27 07:30:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-08-27 07:30:59,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708421374] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:30:59,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 07:30:59,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 17 [2021-08-27 07:30:59,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822688128] [2021-08-27 07:30:59,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:30:59,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:30:59,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:30:59,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:30:59,873 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:31:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:31:00,133 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2021-08-27 07:31:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:31:00,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2021-08-27 07:31:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:31:00,134 INFO L225 Difference]: With dead ends: 124 [2021-08-27 07:31:00,134 INFO L226 Difference]: Without dead ends: 124 [2021-08-27 07:31:00,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 234.9ms TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:31:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-08-27 07:31:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2021-08-27 07:31:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 88 states have internal predecessors, (93), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:31:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2021-08-27 07:31:00,138 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 86 [2021-08-27 07:31:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:31:00,138 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2021-08-27 07:31:00,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:31:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2021-08-27 07:31:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-27 07:31:00,139 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:31:00,139 INFO L512 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] [2021-08-27 07:31:00,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-27 07:31:00,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-08-27 07:31:00,360 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting sll_circular_destroyErr1REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:31:00,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:31:00,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1153762941, now seen corresponding path program 1 times [2021-08-27 07:31:00,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:31:00,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903386561] [2021-08-27 07:31:00,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:00,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:31:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:31:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:00,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:31:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:00,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:31:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:31:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:00,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:31:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:00,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:31:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:31:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:00,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:31:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-08-27 07:31:00,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:31:00,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903386561] [2021-08-27 07:31:00,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903386561] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:31:00,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:31:00,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:31:00,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498315303] [2021-08-27 07:31:00,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:31:00,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:31:00,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:31:00,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:31:00,674 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:31:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:31:01,281 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2021-08-27 07:31:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:31:01,282 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2021-08-27 07:31:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:31:01,283 INFO L225 Difference]: With dead ends: 118 [2021-08-27 07:31:01,283 INFO L226 Difference]: Without dead ends: 118 [2021-08-27 07:31:01,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 316.0ms TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:31:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-08-27 07:31:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2021-08-27 07:31:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.139240506329114) internal successors, (90), 86 states have internal predecessors, (90), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:31:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2021-08-27 07:31:01,287 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 86 [2021-08-27 07:31:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:31:01,287 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2021-08-27 07:31:01,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:31:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2021-08-27 07:31:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-27 07:31:01,288 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:31:01,288 INFO L512 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] [2021-08-27 07:31:01,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 07:31:01,288 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting sll_circular_destroyErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:31:01,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:31:01,289 INFO L82 PathProgramCache]: Analyzing trace with hash 871538537, now seen corresponding path program 1 times [2021-08-27 07:31:01,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:31:01,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035241024] [2021-08-27 07:31:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:01,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:31:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:31:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:31:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:01,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:31:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:01,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:31:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:01,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:31:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:01,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:31:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:01,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:31:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:01,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:31:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-08-27 07:31:01,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:31:01,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035241024] [2021-08-27 07:31:01,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035241024] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:31:01,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122067227] [2021-08-27 07:31:01,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:01,498 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:31:01,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:31:01,501 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:31:01,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 07:31:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:02,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 52 conjunts are in the unsatisfiable core [2021-08-27 07:31:02,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:31:02,879 INFO L388 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 15 [2021-08-27 07:31:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 07:31:02,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122067227] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:31:02,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:31:02,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 24 [2021-08-27 07:31:02,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687954254] [2021-08-27 07:31:02,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:31:02,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:31:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:31:02,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:31:02,889 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 25 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 18 states have internal predecessors, (91), 4 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (12), 6 states have call predecessors, (12), 2 states have call successors, (12) [2021-08-27 07:31:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:31:03,791 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2021-08-27 07:31:03,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 07:31:03,791 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 18 states have internal predecessors, (91), 4 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (12), 6 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2021-08-27 07:31:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:31:03,792 INFO L225 Difference]: With dead ends: 118 [2021-08-27 07:31:03,792 INFO L226 Difference]: Without dead ends: 118 [2021-08-27 07:31:03,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 611.5ms TimeCoverageRelationStatistics Valid=157, Invalid=1325, Unknown=0, NotChecked=0, Total=1482 [2021-08-27 07:31:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-08-27 07:31:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2021-08-27 07:31:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.1375) internal successors, (91), 86 states have internal predecessors, (91), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:31:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2021-08-27 07:31:03,796 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 89 [2021-08-27 07:31:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:31:03,796 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2021-08-27 07:31:03,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 18 states have internal predecessors, (91), 4 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (12), 6 states have call predecessors, (12), 2 states have call successors, (12) [2021-08-27 07:31:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2021-08-27 07:31:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-27 07:31:03,800 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:31:03,800 INFO L512 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] [2021-08-27 07:31:03,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-08-27 07:31:04,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:31:04,005 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting sll_circular_destroyErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:31:04,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:31:04,005 INFO L82 PathProgramCache]: Analyzing trace with hash 871538538, now seen corresponding path program 1 times [2021-08-27 07:31:04,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:31:04,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329115407] [2021-08-27 07:31:04,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:04,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:31:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:31:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:04,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:31:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:04,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:31:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:04,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:31:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:04,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:31:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:04,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:31:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:04,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:31:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:04,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:31:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 07:31:05,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:31:05,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329115407] [2021-08-27 07:31:05,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329115407] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:31:05,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765065835] [2021-08-27 07:31:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:05,063 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:31:05,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:31:05,067 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:31:05,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-27 07:31:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:06,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 113 conjunts are in the unsatisfiable core [2021-08-27 07:31:06,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:31:06,087 INFO L388 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 [2021-08-27 07:31:06,395 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:31:06,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:31:06,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:31:06,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:31:06,666 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:31:06,667 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2021-08-27 07:31:06,682 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 07:31:06,683 INFO L388 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 1 case distinctions, treesize of input 55 treesize of output 50 [2021-08-27 07:31:08,735 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_#memory_$Pointer$.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$.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)))) (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset)))) is different from true [2021-08-27 07:31:08,784 INFO L354 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2021-08-27 07:31:08,784 INFO L388 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 96 treesize of output 80 [2021-08-27 07:31:08,804 INFO L354 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2021-08-27 07:31:08,804 INFO L388 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 74 treesize of output 63 [2021-08-27 07:31:10,288 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.offset| (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))))))) is different from true [2021-08-27 07:31:10,328 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-08-27 07:31:10,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 72 [2021-08-27 07:31:10,377 INFO L354 Elim1Store]: treesize reduction 60, result has 36.8 percent of original size [2021-08-27 07:31:10,378 INFO L388 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 69 treesize of output 72 [2021-08-27 07:31:15,213 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 07:31:15,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 07:31:15,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2021-08-27 07:31:15,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320874353] [2021-08-27 07:31:15,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-27 07:31:15,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:31:15,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-27 07:31:15,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3612, Unknown=3, NotChecked=242, Total=4032 [2021-08-27 07:31:15,215 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 30 states have internal predecessors, (70), 6 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-27 07:31:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:31:18,061 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2021-08-27 07:31:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-27 07:31:18,062 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 30 states have internal predecessors, (70), 6 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 89 [2021-08-27 07:31:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:31:18,062 INFO L225 Difference]: With dead ends: 115 [2021-08-27 07:31:18,062 INFO L226 Difference]: Without dead ends: 115 [2021-08-27 07:31:18,063 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 5938.8ms TimeCoverageRelationStatistics Valid=421, Invalid=6555, Unknown=4, NotChecked=330, Total=7310 [2021-08-27 07:31:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-27 07:31:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2021-08-27 07:31:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 88 states have internal predecessors, (92), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:31:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2021-08-27 07:31:18,065 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 89 [2021-08-27 07:31:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:31:18,065 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2021-08-27 07:31:18,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 30 states have internal predecessors, (70), 6 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-27 07:31:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2021-08-27 07:31:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-27 07:31:18,066 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:31:18,066 INFO L512 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] [2021-08-27 07:31:18,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-08-27 07:31:18,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:31:18,269 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr1ENSURES_VIOLATIONMEMORY_LEAK === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:31:18,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:31:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash 904070889, now seen corresponding path program 1 times [2021-08-27 07:31:18,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:31:18,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469453720] [2021-08-27 07:31:18,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:18,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:31:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:18,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:31:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:18,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:31:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:31:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:18,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:31:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:31:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:31:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:18,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:31:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:18,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:31:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:18,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-08-27 07:31:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-08-27 07:31:18,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:31:18,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469453720] [2021-08-27 07:31:18,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469453720] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:31:18,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:31:18,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:31:18,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061178718] [2021-08-27 07:31:18,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:31:18,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:31:18,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:31:18,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:31:18,494 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:31:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:31:18,952 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2021-08-27 07:31:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:31:18,952 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2021-08-27 07:31:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:31:18,953 INFO L225 Difference]: With dead ends: 113 [2021-08-27 07:31:18,953 INFO L226 Difference]: Without dead ends: 111 [2021-08-27 07:31:18,953 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 248.6ms TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:31:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-08-27 07:31:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2021-08-27 07:31:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.1097560975609757) internal successors, (91), 88 states have internal predecessors, (91), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:31:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2021-08-27 07:31:18,956 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 89 [2021-08-27 07:31:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:31:18,957 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2021-08-27 07:31:18,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:31:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2021-08-27 07:31:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-27 07:31:18,957 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:31:18,958 INFO L512 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] [2021-08-27 07:31:18,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-27 07:31:18,958 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:31:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:31:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1247889481, now seen corresponding path program 1 times [2021-08-27 07:31:18,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:31:18,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039143477] [2021-08-27 07:31:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:18,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:31:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:31:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:19,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:31:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:19,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:31:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:31:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:19,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:31:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:19,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:31:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:19,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:31:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:19,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:31:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-08-27 07:31:19,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:31:19,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039143477] [2021-08-27 07:31:19,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039143477] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:31:19,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:31:19,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:31:19,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376210861] [2021-08-27 07:31:19,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:31:19,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:31:19,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:31:19,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:31:19,157 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:31:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:31:19,641 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2021-08-27 07:31:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:31:19,642 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 90 [2021-08-27 07:31:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:31:19,643 INFO L225 Difference]: With dead ends: 109 [2021-08-27 07:31:19,643 INFO L226 Difference]: Without dead ends: 109 [2021-08-27 07:31:19,643 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 232.7ms TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:31:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-08-27 07:31:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2021-08-27 07:31:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 87 states have internal predecessors, (89), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:31:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2021-08-27 07:31:19,646 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 90 [2021-08-27 07:31:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:31:19,646 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2021-08-27 07:31:19,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:31:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2021-08-27 07:31:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-27 07:31:19,647 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:31:19,647 INFO L512 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] [2021-08-27 07:31:19,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-27 07:31:19,648 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:31:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:31:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash 927337902, now seen corresponding path program 1 times [2021-08-27 07:31:19,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:31:19,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087423898] [2021-08-27 07:31:19,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:19,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:31:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:19,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:31:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:19,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:31:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:20,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:31:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:20,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:31:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:20,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:31:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:31:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:20,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:31:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:20,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:31:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-27 07:31:20,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:31:20,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087423898] [2021-08-27 07:31:20,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087423898] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:31:20,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496109260] [2021-08-27 07:31:20,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:20,469 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:31:20,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:31:20,473 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:31:20,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-27 07:31:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:21,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 83 conjunts are in the unsatisfiable core [2021-08-27 07:31:21,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:31:21,659 INFO L388 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 [2021-08-27 07:31:21,755 INFO L388 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 11 treesize of output 9 [2021-08-27 07:31:21,878 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:31:21,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:31:21,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:31:22,017 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:31:22,017 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2021-08-27 07:31:22,279 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:31:22,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2021-08-27 07:31:22,965 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (= |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))))) (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset))) is different from true [2021-08-27 07:31:23,028 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 07:31:23,028 INFO L388 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 51 treesize of output 33 [2021-08-27 07:31:23,072 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:31:23,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2021-08-27 07:31:24,116 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (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))))))) is different from true [2021-08-27 07:31:24,156 INFO L354 Elim1Store]: treesize reduction 127, result has 15.9 percent of original size [2021-08-27 07:31:24,156 INFO L388 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 57 [2021-08-27 07:31:24,587 INFO L388 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 13 [2021-08-27 07:31:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2021-08-27 07:31:24,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496109260] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:31:24,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:31:24,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 45 [2021-08-27 07:31:24,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739718673] [2021-08-27 07:31:24,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-08-27 07:31:24,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:31:24,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-08-27 07:31:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1752, Unknown=2, NotChecked=170, Total=2070 [2021-08-27 07:31:24,646 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand has 46 states, 45 states have (on average 2.422222222222222) internal successors, (109), 35 states have internal predecessors, (109), 6 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2021-08-27 07:31:29,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:31:29,277 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2021-08-27 07:31:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 07:31:29,278 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.422222222222222) internal successors, (109), 35 states have internal predecessors, (109), 6 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) Word has length 92 [2021-08-27 07:31:29,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:31:29,278 INFO L225 Difference]: With dead ends: 110 [2021-08-27 07:31:29,278 INFO L226 Difference]: Without dead ends: 110 [2021-08-27 07:31:29,279 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 6190.0ms TimeCoverageRelationStatistics Valid=432, Invalid=3864, Unknown=2, NotChecked=258, Total=4556 [2021-08-27 07:31:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-08-27 07:31:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2021-08-27 07:31:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 88 states have internal predecessors, (90), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:31:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2021-08-27 07:31:29,281 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 92 [2021-08-27 07:31:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:31:29,282 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2021-08-27 07:31:29,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.422222222222222) internal successors, (109), 35 states have internal predecessors, (109), 6 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2021-08-27 07:31:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2021-08-27 07:31:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-27 07:31:29,283 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:31:29,283 INFO L512 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] [2021-08-27 07:31:29,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-08-27 07:31:29,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-08-27 07:31:29,509 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting sll_circular_destroyErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:31:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:31:29,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1093942222, now seen corresponding path program 1 times [2021-08-27 07:31:29,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:31:29,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912053919] [2021-08-27 07:31:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:29,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:31:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:29,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:31:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:31:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:30,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:31:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:30,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:31:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:30,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:31:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:30,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:31:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:31:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:30,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:31:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-27 07:31:30,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:31:30,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912053919] [2021-08-27 07:31:30,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912053919] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:31:30,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547369797] [2021-08-27 07:31:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:30,963 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:31:30,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:31:30,965 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:31:30,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-27 07:31:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:32,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 113 conjunts are in the unsatisfiable core [2021-08-27 07:31:32,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:31:32,267 INFO L388 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 [2021-08-27 07:31:32,535 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:31:32,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:31:32,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:31:32,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:31:32,795 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 07:31:32,796 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-08-27 07:31:32,806 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 07:31:32,806 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2021-08-27 07:31:34,185 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_#memory_$Pointer$.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$.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)))) (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset)))) is different from true [2021-08-27 07:31:34,225 INFO L354 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2021-08-27 07:31:34,225 INFO L388 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 80 treesize of output 66 [2021-08-27 07:31:34,244 INFO L354 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2021-08-27 07:31:34,244 INFO L388 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 61 treesize of output 43 [2021-08-27 07:31:35,919 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 (= |c_#memory_$Pointer$.base| (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$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))) (<= (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)))) is different from true [2021-08-27 07:31:35,971 INFO L354 Elim1Store]: treesize reduction 153, result has 12.6 percent of original size [2021-08-27 07:31:35,971 INFO L388 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 87 [2021-08-27 07:31:35,995 INFO L354 Elim1Store]: treesize reduction 165, result has 11.8 percent of original size [2021-08-27 07:31:35,996 INFO L388 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 50 [2021-08-27 07:31:38,249 INFO L354 Elim1Store]: treesize reduction 69, result has 9.2 percent of original size [2021-08-27 07:31:38,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2021-08-27 07:31:38,264 INFO L354 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2021-08-27 07:31:38,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 26 [2021-08-27 07:31:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 2 not checked. [2021-08-27 07:31:38,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547369797] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:31:38,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:31:38,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 62 [2021-08-27 07:31:38,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436937302] [2021-08-27 07:31:38,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-08-27 07:31:38,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:31:38,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-08-27 07:31:38,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3356, Unknown=2, NotChecked=234, Total=3782 [2021-08-27 07:31:38,500 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand has 62 states, 62 states have (on average 2.0) internal successors, (124), 49 states have internal predecessors, (124), 7 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2021-08-27 07:32:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:32:00,836 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2021-08-27 07:32:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 07:32:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0) internal successors, (124), 49 states have internal predecessors, (124), 7 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) Word has length 95 [2021-08-27 07:32:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:32:00,837 INFO L225 Difference]: With dead ends: 96 [2021-08-27 07:32:00,837 INFO L226 Difference]: Without dead ends: 96 [2021-08-27 07:32:00,837 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 15335.6ms TimeCoverageRelationStatistics Valid=492, Invalid=6318, Unknown=4, NotChecked=326, Total=7140 [2021-08-27 07:32:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-27 07:32:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-08-27 07:32:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.013157894736842) internal successors, (77), 77 states have internal predecessors, (77), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:32:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2021-08-27 07:32:00,839 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 95 [2021-08-27 07:32:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:32:00,840 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2021-08-27 07:32:00,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.0) internal successors, (124), 49 states have internal predecessors, (124), 7 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2021-08-27 07:32:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2021-08-27 07:32:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-27 07:32:00,841 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:32:00,841 INFO L512 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] [2021-08-27 07:32:00,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-08-27 07:32:01,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-08-27 07:32:01,069 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:32:01,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:32:01,069 INFO L82 PathProgramCache]: Analyzing trace with hash -988555106, now seen corresponding path program 1 times [2021-08-27 07:32:01,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:32:01,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839993572] [2021-08-27 07:32:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:32:01,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:32:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:01,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:32:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:01,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:32:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:32:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:32:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:01,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:32:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:01,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:32:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:01,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:32:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:01,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:32:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-27 07:32:01,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:32:01,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839993572] [2021-08-27 07:32:01,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839993572] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:32:01,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922835306] [2021-08-27 07:32:01,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:32:01,740 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:32:01,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:32:01,741 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:32:01,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-27 07:32:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:03,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 07:32:03,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:32:03,496 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-27 07:32:03,496 INFO L388 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 1 case distinctions, treesize of input 20 treesize of output 26 [2021-08-27 07:32:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-27 07:32:03,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922835306] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:32:03,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:32:03,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 7] total 35 [2021-08-27 07:32:03,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256718247] [2021-08-27 07:32:03,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-27 07:32:03,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:32:03,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-27 07:32:03,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2021-08-27 07:32:03,647 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 29 states have internal predecessors, (115), 4 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-08-27 07:32:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:32:05,035 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2021-08-27 07:32:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-27 07:32:05,036 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 29 states have internal predecessors, (115), 4 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 97 [2021-08-27 07:32:05,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:32:05,036 INFO L225 Difference]: With dead ends: 95 [2021-08-27 07:32:05,037 INFO L226 Difference]: Without dead ends: 95 [2021-08-27 07:32:05,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1317.7ms TimeCoverageRelationStatistics Valid=284, Invalid=2686, Unknown=0, NotChecked=0, Total=2970 [2021-08-27 07:32:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-27 07:32:05,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-08-27 07:32:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.0) internal successors, (76), 76 states have internal predecessors, (76), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-27 07:32:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2021-08-27 07:32:05,039 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 97 [2021-08-27 07:32:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:32:05,040 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2021-08-27 07:32:05,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 29 states have internal predecessors, (115), 4 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-08-27 07:32:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2021-08-27 07:32:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-27 07:32:05,041 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:32:05,041 INFO L512 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] [2021-08-27 07:32:05,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-08-27 07:32:05,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:32:05,251 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr1ENSURES_VIOLATIONMEMORY_LEAK === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 24 more)] === [2021-08-27 07:32:05,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:32:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash -261539966, now seen corresponding path program 1 times [2021-08-27 07:32:05,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:32:05,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454082507] [2021-08-27 07:32:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:32:05,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:32:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:05,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:32:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:05,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:32:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:05,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:32:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:05,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:32:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:05,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:32:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:05,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:32:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:06,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:32:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:32:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-08-27 07:32:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-27 07:32:06,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:32:06,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454082507] [2021-08-27 07:32:06,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454082507] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:32:06,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212331196] [2021-08-27 07:32:06,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:32:06,386 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:32:06,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:32:06,387 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:32:06,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-08-27 07:32:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:32:07,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 87 conjunts are in the unsatisfiable core [2021-08-27 07:32:07,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:32:08,060 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-08-27 07:32:08,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 23 treesize of output 31 [2021-08-27 07:32:08,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-08-27 07:32:08,348 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:32:08,348 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2021-08-27 07:32:08,752 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:32:08,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2021-08-27 07:32:08,757 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 07:32:08,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-08-27 07:32:14,578 INFO L354 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2021-08-27 07:32:14,579 INFO L388 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 60 treesize of output 44 [2021-08-27 07:32:14,821 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:32:14,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 40 [2021-08-27 07:32:14,826 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 07:32:14,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2021-08-27 07:32:15,443 INFO L354 Elim1Store]: treesize reduction 132, result has 15.4 percent of original size [2021-08-27 07:32:15,443 INFO L388 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 77 [2021-08-27 07:32:15,612 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:32:15,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2021-08-27 07:32:15,897 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:32:15,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2021-08-27 07:32:16,201 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:32:16,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2021-08-27 07:32:16,205 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:32:16,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2021-08-27 07:32:45,123 INFO L354 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2021-08-27 07:32:45,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 55 [2021-08-27 07:32:45,137 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-27 07:32:45,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 43 [2021-08-27 07:32:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-27 07:32:45,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212331196] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:32:45,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:32:45,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 61 [2021-08-27 07:32:45,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241979755] [2021-08-27 07:32:45,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-08-27 07:32:45,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:32:45,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-08-27 07:32:45,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3577, Unknown=15, NotChecked=0, Total=3782 [2021-08-27 07:32:45,277 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand has 62 states, 61 states have (on average 2.262295081967213) internal successors, (138), 52 states have internal predecessors, (138), 8 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2021-08-27 07:33:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:33:41,544 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2021-08-27 07:33:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 07:33:41,544 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.262295081967213) internal successors, (138), 52 states have internal predecessors, (138), 8 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) Word has length 101 [2021-08-27 07:33:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:33:41,545 INFO L225 Difference]: With dead ends: 94 [2021-08-27 07:33:41,545 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 07:33:41,545 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 55842.1ms TimeCoverageRelationStatistics Valid=501, Invalid=7314, Unknown=17, NotChecked=0, Total=7832 [2021-08-27 07:33:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 07:33:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 07:33:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 07:33:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 07:33:41,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2021-08-27 07:33:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:33:41,546 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 07:33:41,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.262295081967213) internal successors, (138), 52 states have internal predecessors, (138), 8 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2021-08-27 07:33:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 07:33:41,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 07:33:41,548 INFO L764 garLoopResultBuilder]: Registering result SAFE for location node_createErr0REQUIRES_VIOLATION [2021-08-27 07:33:41,548 INFO L764 garLoopResultBuilder]: Registering result SAFE for location node_createErr1REQUIRES_VIOLATION [2021-08-27 07:33:41,548 INFO L764 garLoopResultBuilder]: Registering result SAFE for location node_createErr2REQUIRES_VIOLATION [2021-08-27 07:33:41,548 INFO L764 garLoopResultBuilder]: Registering result SAFE for location node_createErr3REQUIRES_VIOLATION [2021-08-27 07:33:41,548 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:33:41,548 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:33:41,548 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_update_atErr0REQUIRES_VIOLATION [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_update_atErr1REQUIRES_VIOLATION [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_update_atErr2REQUIRES_VIOLATION [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_update_atErr3REQUIRES_VIOLATION [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_destroyErr0REQUIRES_VIOLATION [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_destroyErr1REQUIRES_VIOLATION [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_destroyErr2REQUIRES_VIOLATION [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_destroyErr3REQUIRES_VIOLATION [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_createErr0REQUIRES_VIOLATION [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_createErr1REQUIRES_VIOLATION [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_createErr2REQUIRES_VIOLATION [2021-08-27 07:33:41,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_createErr3REQUIRES_VIOLATION [2021-08-27 07:33:41,550 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_get_data_atErr0REQUIRES_VIOLATION [2021-08-27 07:33:41,550 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_get_data_atErr1REQUIRES_VIOLATION [2021-08-27 07:33:41,550 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_get_data_atErr2REQUIRES_VIOLATION [2021-08-27 07:33:41,550 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sll_circular_get_data_atErr3REQUIRES_VIOLATION [2021-08-27 07:33:41,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-08-27 07:33:41,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:33:41,754 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:33:41,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:33:41 BoogieIcfgContainer [2021-08-27 07:33:41,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:33:41,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:33:41,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:33:41,759 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:33:41,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:26:09" (3/4) ... [2021-08-27 07:33:41,762 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 07:33:41,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-08-27 07:33:41,768 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-08-27 07:33:41,768 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2021-08-27 07:33:41,768 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_get_data_at [2021-08-27 07:33:41,768 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2021-08-27 07:33:41,768 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2021-08-27 07:33:41,768 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2021-08-27 07:33:41,769 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_destroy [2021-08-27 07:33:41,769 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-08-27 07:33:41,769 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_update_at [2021-08-27 07:33:41,769 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2021-08-27 07:33:41,777 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2021-08-27 07:33:41,777 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-08-27 07:33:41,778 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-27 07:33:41,778 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-27 07:33:41,830 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 07:33:41,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:33:41,831 INFO L168 Benchmark]: Toolchain (without parser) took 453246.18 ms. Allocated memory was 54.5 MB in the beginning and 488.6 MB in the end (delta: 434.1 MB). Free memory was 30.2 MB in the beginning and 250.8 MB in the end (delta: -220.6 MB). Peak memory consumption was 214.3 MB. Max. memory is 16.1 GB. [2021-08-27 07:33:41,832 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 37.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:33:41,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.15 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.0 MB in the beginning and 44.0 MB in the end (delta: -13.9 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-08-27 07:33:41,836 INFO L168 Benchmark]: Boogie Preprocessor took 55.42 ms. Allocated memory is still 67.1 MB. Free memory was 43.8 MB in the beginning and 41.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:33:41,837 INFO L168 Benchmark]: RCFGBuilder took 872.73 ms. Allocated memory is still 67.1 MB. Free memory was 40.9 MB in the beginning and 34.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2021-08-27 07:33:41,837 INFO L168 Benchmark]: TraceAbstraction took 451829.82 ms. Allocated memory was 67.1 MB in the beginning and 488.6 MB in the end (delta: 421.5 MB). Free memory was 33.8 MB in the beginning and 254.5 MB in the end (delta: -220.8 MB). Peak memory consumption was 200.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:33:41,838 INFO L168 Benchmark]: Witness Printer took 71.70 ms. Allocated memory is still 488.6 MB. Free memory was 254.5 MB in the beginning and 250.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:33:41,842 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 37.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 410.15 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.0 MB in the beginning and 44.0 MB in the end (delta: -13.9 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.42 ms. Allocated memory is still 67.1 MB. Free memory was 43.8 MB in the beginning and 41.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 872.73 ms. Allocated memory is still 67.1 MB. Free memory was 40.9 MB in the beginning and 34.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 451829.82 ms. Allocated memory was 67.1 MB in the beginning and 488.6 MB in the end (delta: 421.5 MB). Free memory was 33.8 MB in the beginning and 254.5 MB in the end (delta: -220.8 MB). Peak memory consumption was 200.2 MB. Max. memory is 16.1 GB. * Witness Printer took 71.70 ms. Allocated memory is still 488.6 MB. Free memory was 254.5 MB in the beginning and 250.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 620]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: 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: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: 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: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 114 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 451768.4ms, OverallIterations: 37, TraceHistogramMax: 3, EmptinessCheckTime: 49.9ms, AutomataDifference: 265033.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2310 SDtfs, 6964 SDslu, 12232 SDs, 0 SdLazy, 43820 SolverSat, 1573 SolverUnsat, 163 SolverUnknown, 0 SolverNotchecked, 155056.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2925 GetRequests, 1636 SyntacticMatches, 48 SemanticMatches, 1241 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 12525 ImplicationChecksByTransitivity, 243936.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=15, InterpolantAutomatonStates: 648, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 197.0ms AutomataMinimizationTime, 37 MinimizatonAttempts, 770 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 456.3ms SsaConstructionTime, 1545.7ms SatisfiabilityAnalysisTime, 155606.7ms InterpolantComputationTime, 3787 NumberOfCodeBlocks, 3760 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 3728 ConstructedInterpolants, 305 QuantifiedInterpolants, 35246 SizeOfPredicates, 263 NumberOfNonLiveVariables, 7919 ConjunctsInSsa, 1029 ConjunctsInUnsatCore, 59 InterpolantComputations, 18 PerfectInterpolantSequences, 958/1341 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-08-27 07:33:41,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...