./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD --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 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:26:53,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:26:53,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:26:53,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:26:53,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:26:53,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:26:53,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:26:53,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:26:53,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:26:53,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:26:53,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:26:53,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:26:53,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:26:53,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:26:53,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:26:53,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:26:53,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:26:53,157 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:26:53,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:26:53,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:26:53,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:26:53,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:26:53,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:26:53,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:26:53,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:26:53,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:26:53,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:26:53,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:26:53,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:26:53,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:26:53,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:26:53,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:26:53,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:26:53,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:26:53,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:26:53,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:26:53,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:26:53,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:26:53,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:26:53,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:26:53,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:26:53,223 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-10-28 23:26:53,282 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:26:53,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:26:53,284 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:26:53,284 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:26:53,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:26:53,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:26:53,287 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:26:53,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:26:53,288 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:26:53,288 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 23:26:53,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:26:53,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:26:53,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:26:53,290 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-28 23:26:53,291 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-28 23:26:53,291 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-28 23:26:53,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 23:26:53,291 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-28 23:26:53,292 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:26:53,292 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:26:53,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:26:53,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:26:53,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 23:26:53,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:26:53,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:26:53,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 23:26:53,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:26:53,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 23:26:53,295 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:26:53,297 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2021-10-28 23:26:53,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:26:53,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:26:53,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:26:53,725 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:26:53,726 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:26:53,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-10-28 23:26:53,803 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/data/2d152654d/fa65875d76034149a038aa18e8eb7a6a/FLAG171745993 [2021-10-28 23:26:54,532 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:26:54,535 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-10-28 23:26:54,567 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/data/2d152654d/fa65875d76034149a038aa18e8eb7a6a/FLAG171745993 [2021-10-28 23:26:54,737 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/data/2d152654d/fa65875d76034149a038aa18e8eb7a6a [2021-10-28 23:26:54,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:26:54,742 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-28 23:26:54,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:26:54,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:26:54,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:26:54,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:26:54" (1/1) ... [2021-10-28 23:26:54,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0762f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:26:54, skipping insertion in model container [2021-10-28 23:26:54,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:26:54" (1/1) ... [2021-10-28 23:26:54,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:26:54,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:26:55,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-10-28 23:26:55,223 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-10-28 23:26:55,226 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-10-28 23:26:55,228 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-10-28 23:26:55,231 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-10-28 23:26:55,233 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-10-28 23:26:55,236 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-10-28 23:26:55,237 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-10-28 23:26:55,239 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-10-28 23:26:55,241 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-10-28 23:26:55,243 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-10-28 23:26:55,245 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-10-28 23:26:55,246 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-10-28 23:26:55,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:26:55,281 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:26:55,351 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-10-28 23:26:55,367 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-10-28 23:26:55,369 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-10-28 23:26:55,370 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-10-28 23:26:55,374 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-10-28 23:26:55,375 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-10-28 23:26:55,378 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-10-28 23:26:55,379 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-10-28 23:26:55,380 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-10-28 23:26:55,382 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-10-28 23:26:55,401 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-10-28 23:26:55,402 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-10-28 23:26:55,403 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-10-28 23:26:55,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:26:55,446 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:26:55,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:26:55 WrapperNode [2021-10-28 23:26:55,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:26:55,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:26:55,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:26:55,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:26:55,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:26:55" (1/1) ... [2021-10-28 23:26:55,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:26:55" (1/1) ... [2021-10-28 23:26:55,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:26:55" (1/1) ... [2021-10-28 23:26:55,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:26:55" (1/1) ... [2021-10-28 23:26:55,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:26:55" (1/1) ... [2021-10-28 23:26:55,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:26:55" (1/1) ... [2021-10-28 23:26:55,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:26:55" (1/1) ... [2021-10-28 23:26:55,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:26:55,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:26:55,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:26:55,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:26:55,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:26:55" (1/1) ... [2021-10-28 23:26:55,604 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:26:55,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:26:55,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 23:26:55,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 23:26:55,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-28 23:26:55,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:26:55,675 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-28 23:26:55,675 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-28 23:26:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-10-28 23:26:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-10-28 23:26:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-10-28 23:26:55,676 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-10-28 23:26:55,676 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-10-28 23:26:55,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-10-28 23:26:55,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-10-28 23:26:55,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-10-28 23:26:55,676 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-10-28 23:26:55,677 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-10-28 23:26:55,677 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-10-28 23:26:55,677 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-10-28 23:26:55,677 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-10-28 23:26:55,677 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-10-28 23:26:55,677 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-10-28 23:26:55,678 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-10-28 23:26:55,678 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-10-28 23:26:55,678 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-10-28 23:26:55,678 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-10-28 23:26:55,678 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-10-28 23:26:55,679 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-10-28 23:26:55,679 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-10-28 23:26:55,679 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-10-28 23:26:55,679 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-10-28 23:26:55,679 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-10-28 23:26:55,679 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-10-28 23:26:55,680 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-10-28 23:26:55,680 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-10-28 23:26:55,680 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-10-28 23:26:55,680 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-10-28 23:26:55,680 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-10-28 23:26:55,680 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-10-28 23:26:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-10-28 23:26:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-10-28 23:26:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-10-28 23:26:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-10-28 23:26:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-10-28 23:26:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-10-28 23:26:55,682 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-10-28 23:26:55,682 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-10-28 23:26:55,682 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-10-28 23:26:55,682 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-10-28 23:26:55,682 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-10-28 23:26:55,682 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-10-28 23:26:55,683 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-10-28 23:26:55,683 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-10-28 23:26:55,683 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-10-28 23:26:55,683 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-10-28 23:26:55,683 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-10-28 23:26:55,683 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-10-28 23:26:55,684 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-28 23:26:55,684 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-28 23:26:55,684 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-10-28 23:26:55,684 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-28 23:26:55,684 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-10-28 23:26:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-10-28 23:26:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-10-28 23:26:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-10-28 23:26:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-10-28 23:26:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-28 23:26:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-10-28 23:26:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-10-28 23:26:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-10-28 23:26:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-10-28 23:26:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-10-28 23:26:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-10-28 23:26:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-10-28 23:26:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-10-28 23:26:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-10-28 23:26:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-10-28 23:26:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-10-28 23:26:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-10-28 23:26:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-10-28 23:26:55,688 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-10-28 23:26:55,688 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-10-28 23:26:55,688 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-10-28 23:26:55,688 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-10-28 23:26:55,688 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-10-28 23:26:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-10-28 23:26:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-10-28 23:26:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-10-28 23:26:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-10-28 23:26:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-10-28 23:26:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-10-28 23:26:55,690 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-10-28 23:26:55,690 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-10-28 23:26:55,690 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-10-28 23:26:55,690 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-10-28 23:26:55,690 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-10-28 23:26:55,690 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-10-28 23:26:55,691 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-10-28 23:26:55,691 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-10-28 23:26:55,691 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-10-28 23:26:55,691 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-10-28 23:26:55,691 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-10-28 23:26:55,692 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-10-28 23:26:55,692 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-10-28 23:26:55,692 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-10-28 23:26:55,692 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-10-28 23:26:55,692 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-10-28 23:26:55,692 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-10-28 23:26:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-10-28 23:26:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-10-28 23:26:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-28 23:26:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-28 23:26:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-10-28 23:26:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-10-28 23:26:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-28 23:26:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:26:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-28 23:26:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-28 23:26:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-28 23:26:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-28 23:26:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 23:26:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-28 23:26:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:26:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:26:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 23:26:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 23:26:56,780 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:26:56,781 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-10-28 23:26:56,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:26:56 BoogieIcfgContainer [2021-10-28 23:26:56,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:26:56,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 23:26:56,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 23:26:56,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 23:26:56,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:26:54" (1/3) ... [2021-10-28 23:26:56,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248e53da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:26:56, skipping insertion in model container [2021-10-28 23:26:56,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:26:55" (2/3) ... [2021-10-28 23:26:56,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248e53da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:26:56, skipping insertion in model container [2021-10-28 23:26:56,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:26:56" (3/3) ... [2021-10-28 23:26:56,797 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-10-28 23:26:56,804 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 23:26:56,805 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-10-28 23:26:56,865 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 23:26:56,874 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, mAutomataTypeConcurrency=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-10-28 23:26:56,874 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-10-28 23:26:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-28 23:26:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 23:26:56,910 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:26:56,911 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:26:56,912 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:26:56,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:26:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341321, now seen corresponding path program 1 times [2021-10-28 23:26:56,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:26:56,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938607831] [2021-10-28 23:26:56,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:26:56,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:26:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:26:57,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:26:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:26:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:26:57,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:26:57,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938607831] [2021-10-28 23:26:57,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938607831] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:26:57,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:26:57,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:26:57,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361991907] [2021-10-28 23:26:57,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:26:57,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:26:57,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:26:57,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:26:57,276 INFO L87 Difference]: Start difference. First operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:26:57,792 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2021-10-28 23:26:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:26:57,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-28 23:26:57,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:26:57,808 INFO L225 Difference]: With dead ends: 201 [2021-10-28 23:26:57,808 INFO L226 Difference]: Without dead ends: 197 [2021-10-28 23:26:57,810 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:26:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-10-28 23:26:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2021-10-28 23:26:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.7264957264957266) internal successors, (202), 188 states have internal predecessors, (202), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2021-10-28 23:26:57,874 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 7 [2021-10-28 23:26:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:26:57,875 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2021-10-28 23:26:57,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2021-10-28 23:26:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 23:26:57,877 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:26:57,877 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:26:57,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 23:26:57,878 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:26:57,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:26:57,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341322, now seen corresponding path program 1 times [2021-10-28 23:26:57,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:26:57,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671961704] [2021-10-28 23:26:57,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:26:57,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:26:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:26:57,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:26:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:26:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:26:57,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:26:57,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671961704] [2021-10-28 23:26:58,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671961704] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:26:58,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:26:58,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:26:58,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447193511] [2021-10-28 23:26:58,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:26:58,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:26:58,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:26:58,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:26:58,012 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:26:58,520 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2021-10-28 23:26:58,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:26:58,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-28 23:26:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:26:58,524 INFO L225 Difference]: With dead ends: 222 [2021-10-28 23:26:58,524 INFO L226 Difference]: Without dead ends: 222 [2021-10-28 23:26:58,525 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:26:58,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-28 23:26:58,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2021-10-28 23:26:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.664179104477612) internal successors, (223), 198 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2021-10-28 23:26:58,543 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 7 [2021-10-28 23:26:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:26:58,544 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2021-10-28 23:26:58,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2021-10-28 23:26:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-28 23:26:58,546 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:26:58,546 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:26:58,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 23:26:58,547 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:26:58,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:26:58,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2054455159, now seen corresponding path program 1 times [2021-10-28 23:26:58,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:26:58,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221068088] [2021-10-28 23:26:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:26:58,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:26:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:26:58,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:26:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:26:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:26:58,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:26:58,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221068088] [2021-10-28 23:26:58,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221068088] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:26:58,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:26:58,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:26:58,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137799312] [2021-10-28 23:26:58,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:26:58,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:26:58,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:26:58,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:26:58,633 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:26:58,992 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2021-10-28 23:26:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:26:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-10-28 23:26:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:26:58,997 INFO L225 Difference]: With dead ends: 217 [2021-10-28 23:26:58,997 INFO L226 Difference]: Without dead ends: 217 [2021-10-28 23:26:58,998 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:26:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-10-28 23:26:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-10-28 23:26:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 196 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2021-10-28 23:26:59,028 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 9 [2021-10-28 23:26:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:26:59,030 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2021-10-28 23:26:59,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2021-10-28 23:26:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 23:26:59,032 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:26:59,032 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:26:59,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 23:26:59,033 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:26:59,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:26:59,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1492111941, now seen corresponding path program 1 times [2021-10-28 23:26:59,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:26:59,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627950522] [2021-10-28 23:26:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:26:59,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:26:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:26:59,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:26:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:26:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:26:59,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:26:59,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627950522] [2021-10-28 23:26:59,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627950522] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:26:59,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:26:59,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:26:59,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351452349] [2021-10-28 23:26:59,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:26:59,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:26:59,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:26:59,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:26:59,170 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:26:59,621 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-10-28 23:26:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 23:26:59,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-10-28 23:26:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:26:59,624 INFO L225 Difference]: With dead ends: 199 [2021-10-28 23:26:59,624 INFO L226 Difference]: Without dead ends: 199 [2021-10-28 23:26:59,625 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:26:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-28 23:26:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-10-28 23:26:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 195 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-10-28 23:26:59,650 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 15 [2021-10-28 23:26:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:26:59,651 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-10-28 23:26:59,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:26:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-10-28 23:26:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 23:26:59,653 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:26:59,654 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:26:59,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 23:26:59,654 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:26:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:26:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1492111940, now seen corresponding path program 1 times [2021-10-28 23:26:59,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:26:59,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713234762] [2021-10-28 23:26:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:26:59,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:26:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:26:59,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:26:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:26:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:26:59,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:26:59,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713234762] [2021-10-28 23:26:59,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713234762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:26:59,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:26:59,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:26:59,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709287247] [2021-10-28 23:26:59,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:26:59,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:26:59,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:26:59,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:26:59,873 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:00,340 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2021-10-28 23:27:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 23:27:00,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-10-28 23:27:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:00,343 INFO L225 Difference]: With dead ends: 198 [2021-10-28 23:27:00,343 INFO L226 Difference]: Without dead ends: 198 [2021-10-28 23:27:00,344 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:27:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-28 23:27:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-10-28 23:27:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 194 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-10-28 23:27:00,350 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 15 [2021-10-28 23:27:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:00,351 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-10-28 23:27:00,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-10-28 23:27:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 23:27:00,352 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:00,352 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:00,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 23:27:00,352 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash 331044621, now seen corresponding path program 1 times [2021-10-28 23:27:00,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:00,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778469942] [2021-10-28 23:27:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:00,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:00,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:00,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:00,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778469942] [2021-10-28 23:27:00,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778469942] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:00,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:00,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:27:00,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788535055] [2021-10-28 23:27:00,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:27:00,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:00,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:27:00,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:00,447 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:00,733 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-10-28 23:27:00,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:27:00,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-10-28 23:27:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:00,736 INFO L225 Difference]: With dead ends: 199 [2021-10-28 23:27:00,736 INFO L226 Difference]: Without dead ends: 199 [2021-10-28 23:27:00,736 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-28 23:27:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-10-28 23:27:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 195 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-10-28 23:27:00,746 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 17 [2021-10-28 23:27:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:00,746 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-10-28 23:27:00,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-10-28 23:27:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 23:27:00,748 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:00,749 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:00,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 23:27:00,749 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1404699164, now seen corresponding path program 1 times [2021-10-28 23:27:00,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:00,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489505096] [2021-10-28 23:27:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:00,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:00,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:00,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:00,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489505096] [2021-10-28 23:27:00,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489505096] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:00,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:00,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:27:00,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052895803] [2021-10-28 23:27:00,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:27:00,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:00,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:27:00,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:27:00,939 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:01,626 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2021-10-28 23:27:01,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 23:27:01,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-10-28 23:27:01,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:01,628 INFO L225 Difference]: With dead ends: 199 [2021-10-28 23:27:01,629 INFO L226 Difference]: Without dead ends: 199 [2021-10-28 23:27:01,629 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-28 23:27:01,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-28 23:27:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2021-10-28 23:27:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.626865671641791) internal successors, (218), 194 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-10-28 23:27:01,638 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 18 [2021-10-28 23:27:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:01,639 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-10-28 23:27:01,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-10-28 23:27:01,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 23:27:01,641 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:01,641 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:01,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 23:27:01,641 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:01,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:01,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1404699165, now seen corresponding path program 1 times [2021-10-28 23:27:01,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:01,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714034584] [2021-10-28 23:27:01,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:01,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:01,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:01,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:01,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714034584] [2021-10-28 23:27:01,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714034584] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:01,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:01,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:27:01,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181222691] [2021-10-28 23:27:01,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:27:01,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:01,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:27:01,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:27:01,859 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:02,621 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-10-28 23:27:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 23:27:02,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-10-28 23:27:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:02,624 INFO L225 Difference]: With dead ends: 198 [2021-10-28 23:27:02,624 INFO L226 Difference]: Without dead ends: 198 [2021-10-28 23:27:02,625 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-28 23:27:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-28 23:27:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-10-28 23:27:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.6194029850746268) internal successors, (217), 193 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-10-28 23:27:02,649 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 18 [2021-10-28 23:27:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:02,649 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-10-28 23:27:02,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-10-28 23:27:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 23:27:02,651 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:02,651 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:02,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 23:27:02,652 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash 307937042, now seen corresponding path program 1 times [2021-10-28 23:27:02,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:02,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403053200] [2021-10-28 23:27:02,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:02,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:02,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:02,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:02,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403053200] [2021-10-28 23:27:02,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403053200] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:02,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:02,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:27:02,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941129854] [2021-10-28 23:27:02,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 23:27:02,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 23:27:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:27:02,844 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:03,423 INFO L93 Difference]: Finished difference Result 289 states and 319 transitions. [2021-10-28 23:27:03,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 23:27:03,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-10-28 23:27:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:03,426 INFO L225 Difference]: With dead ends: 289 [2021-10-28 23:27:03,426 INFO L226 Difference]: Without dead ends: 289 [2021-10-28 23:27:03,426 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-28 23:27:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-28 23:27:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2021-10-28 23:27:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.621212121212121) internal successors, (214), 190 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2021-10-28 23:27:03,434 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 19 [2021-10-28 23:27:03,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:03,434 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2021-10-28 23:27:03,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2021-10-28 23:27:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 23:27:03,436 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:03,436 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:03,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 23:27:03,436 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1873843689, now seen corresponding path program 1 times [2021-10-28 23:27:03,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:03,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560020153] [2021-10-28 23:27:03,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:03,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:03,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:03,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:03,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560020153] [2021-10-28 23:27:03,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560020153] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:03,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:03,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:27:03,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753672547] [2021-10-28 23:27:03,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:27:03,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:03,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:27:03,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:27:03,524 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:03,941 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2021-10-28 23:27:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:27:03,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-10-28 23:27:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:03,945 INFO L225 Difference]: With dead ends: 290 [2021-10-28 23:27:03,945 INFO L226 Difference]: Without dead ends: 290 [2021-10-28 23:27:03,945 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:27:03,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-28 23:27:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2021-10-28 23:27:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.6074074074074074) internal successors, (217), 193 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-10-28 23:27:03,953 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 21 [2021-10-28 23:27:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:03,953 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-10-28 23:27:03,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-10-28 23:27:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 23:27:03,955 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:03,956 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:03,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 23:27:03,956 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:03,957 INFO L85 PathProgramCache]: Analyzing trace with hash -515815524, now seen corresponding path program 1 times [2021-10-28 23:27:03,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:03,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522678971] [2021-10-28 23:27:03,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:03,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:04,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:04,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:04,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522678971] [2021-10-28 23:27:04,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522678971] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:04,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:04,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:27:04,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081993671] [2021-10-28 23:27:04,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:27:04,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:04,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:27:04,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:27:04,043 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:04,424 INFO L93 Difference]: Finished difference Result 193 states and 214 transitions. [2021-10-28 23:27:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:27:04,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-10-28 23:27:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:04,427 INFO L225 Difference]: With dead ends: 193 [2021-10-28 23:27:04,427 INFO L226 Difference]: Without dead ends: 193 [2021-10-28 23:27:04,427 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:27:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-10-28 23:27:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2021-10-28 23:27:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 184 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2021-10-28 23:27:04,434 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 23 [2021-10-28 23:27:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:04,435 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2021-10-28 23:27:04,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2021-10-28 23:27:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 23:27:04,436 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:04,436 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:04,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 23:27:04,437 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:04,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:04,438 INFO L85 PathProgramCache]: Analyzing trace with hash -515815523, now seen corresponding path program 1 times [2021-10-28 23:27:04,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:04,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234789136] [2021-10-28 23:27:04,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:04,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:04,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:04,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:04,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234789136] [2021-10-28 23:27:04,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234789136] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:04,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:04,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:27:04,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216418521] [2021-10-28 23:27:04,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:27:04,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:04,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:27:04,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:27:04,562 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:05,107 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2021-10-28 23:27:05,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:27:05,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-10-28 23:27:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:05,110 INFO L225 Difference]: With dead ends: 249 [2021-10-28 23:27:05,110 INFO L226 Difference]: Without dead ends: 249 [2021-10-28 23:27:05,110 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:27:05,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-10-28 23:27:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 212. [2021-10-28 23:27:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 208 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2021-10-28 23:27:05,124 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 23 [2021-10-28 23:27:05,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:05,125 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2021-10-28 23:27:05,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2021-10-28 23:27:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-28 23:27:05,127 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:05,127 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:05,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 23:27:05,127 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1777429398, now seen corresponding path program 1 times [2021-10-28 23:27:05,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:05,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575060448] [2021-10-28 23:27:05,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:05,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:05,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:05,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575060448] [2021-10-28 23:27:05,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575060448] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:05,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:05,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:27:05,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675404326] [2021-10-28 23:27:05,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:27:05,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:05,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:27:05,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:27:05,193 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:05,521 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2021-10-28 23:27:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:27:05,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-10-28 23:27:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:05,524 INFO L225 Difference]: With dead ends: 244 [2021-10-28 23:27:05,524 INFO L226 Difference]: Without dead ends: 244 [2021-10-28 23:27:05,525 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:27:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-28 23:27:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2021-10-28 23:27:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 160 states have (on average 1.525) internal successors, (244), 206 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2021-10-28 23:27:05,534 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 25 [2021-10-28 23:27:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:05,535 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2021-10-28 23:27:05,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2021-10-28 23:27:05,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 23:27:05,536 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:05,536 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:05,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 23:27:05,537 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:05,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:05,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1241440350, now seen corresponding path program 1 times [2021-10-28 23:27:05,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:05,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269811787] [2021-10-28 23:27:05,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:05,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:05,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:05,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269811787] [2021-10-28 23:27:05,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269811787] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:05,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:05,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:27:05,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673044791] [2021-10-28 23:27:05,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:27:05,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:05,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:27:05,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:27:05,620 INFO L87 Difference]: Start difference. First operand 210 states and 247 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:06,093 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-10-28 23:27:06,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 23:27:06,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-10-28 23:27:06,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:06,095 INFO L225 Difference]: With dead ends: 210 [2021-10-28 23:27:06,095 INFO L226 Difference]: Without dead ends: 210 [2021-10-28 23:27:06,097 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:27:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-28 23:27:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-10-28 23:27:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 205 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2021-10-28 23:27:06,113 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 27 [2021-10-28 23:27:06,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:06,114 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2021-10-28 23:27:06,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2021-10-28 23:27:06,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 23:27:06,123 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:06,124 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:06,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 23:27:06,125 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:06,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:06,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1241440351, now seen corresponding path program 1 times [2021-10-28 23:27:06,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:06,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439197834] [2021-10-28 23:27:06,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:06,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:06,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:06,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:06,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439197834] [2021-10-28 23:27:06,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439197834] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:06,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:06,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:27:06,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702755448] [2021-10-28 23:27:06,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:27:06,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:06,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:27:06,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:27:06,271 INFO L87 Difference]: Start difference. First operand 209 states and 246 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:06,747 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2021-10-28 23:27:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 23:27:06,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-10-28 23:27:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:06,749 INFO L225 Difference]: With dead ends: 202 [2021-10-28 23:27:06,750 INFO L226 Difference]: Without dead ends: 202 [2021-10-28 23:27:06,750 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-28 23:27:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-28 23:27:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2021-10-28 23:27:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 191 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2021-10-28 23:27:06,758 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 27 [2021-10-28 23:27:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:06,758 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2021-10-28 23:27:06,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2021-10-28 23:27:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-28 23:27:06,760 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:06,760 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:06,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 23:27:06,761 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr26ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash -976729154, now seen corresponding path program 1 times [2021-10-28 23:27:06,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:06,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491653835] [2021-10-28 23:27:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:06,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:06,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:06,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:06,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491653835] [2021-10-28 23:27:06,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491653835] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:06,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:06,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:27:06,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131645667] [2021-10-28 23:27:06,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:27:06,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:06,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:27:06,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:27:06,842 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:07,195 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2021-10-28 23:27:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 23:27:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-10-28 23:27:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:07,197 INFO L225 Difference]: With dead ends: 198 [2021-10-28 23:27:07,197 INFO L226 Difference]: Without dead ends: 198 [2021-10-28 23:27:07,198 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-28 23:27:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-28 23:27:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2021-10-28 23:27:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 187 states have internal predecessors, (224), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2021-10-28 23:27:07,206 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 29 [2021-10-28 23:27:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:07,206 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2021-10-28 23:27:07,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2021-10-28 23:27:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 23:27:07,208 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:07,208 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:07,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 23:27:07,208 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr59ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:07,209 INFO L85 PathProgramCache]: Analyzing trace with hash 90529238, now seen corresponding path program 1 times [2021-10-28 23:27:07,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:07,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896884746] [2021-10-28 23:27:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:07,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:07,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:07,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:07,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896884746] [2021-10-28 23:27:07,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896884746] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:07,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:07,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:27:07,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662112100] [2021-10-28 23:27:07,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:27:07,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:07,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:27:07,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:07,270 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:07,503 INFO L93 Difference]: Finished difference Result 264 states and 315 transitions. [2021-10-28 23:27:07,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:27:07,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-10-28 23:27:07,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:07,506 INFO L225 Difference]: With dead ends: 264 [2021-10-28 23:27:07,507 INFO L226 Difference]: Without dead ends: 264 [2021-10-28 23:27:07,507 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-28 23:27:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 197. [2021-10-28 23:27:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.4591194968553458) internal successors, (232), 193 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2021-10-28 23:27:07,515 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 31 [2021-10-28 23:27:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:07,515 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2021-10-28 23:27:07,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2021-10-28 23:27:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 23:27:07,516 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:07,516 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:07,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 23:27:07,517 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:07,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:07,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1488582203, now seen corresponding path program 1 times [2021-10-28 23:27:07,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:07,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439481262] [2021-10-28 23:27:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:07,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:07,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:07,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:07,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439481262] [2021-10-28 23:27:07,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439481262] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:07,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:07,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:27:07,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508839320] [2021-10-28 23:27:07,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:27:07,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:07,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:27:07,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:07,580 INFO L87 Difference]: Start difference. First operand 197 states and 235 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:07,829 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2021-10-28 23:27:07,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:27:07,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-10-28 23:27:07,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:07,833 INFO L225 Difference]: With dead ends: 195 [2021-10-28 23:27:07,834 INFO L226 Difference]: Without dead ends: 195 [2021-10-28 23:27:07,834 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-10-28 23:27:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-10-28 23:27:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 158 states have (on average 1.4493670886075949) internal successors, (229), 191 states have internal predecessors, (229), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2021-10-28 23:27:07,848 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 32 [2021-10-28 23:27:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:07,848 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2021-10-28 23:27:07,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2021-10-28 23:27:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 23:27:07,851 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:07,851 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:07,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 23:27:07,852 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:07,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1098596299, now seen corresponding path program 1 times [2021-10-28 23:27:07,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:07,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591215330] [2021-10-28 23:27:07,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:07,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:08,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:08,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:08,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591215330] [2021-10-28 23:27:08,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591215330] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:08,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:08,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 23:27:08,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057614101] [2021-10-28 23:27:08,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 23:27:08,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:08,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 23:27:08,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-28 23:27:08,066 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:08,798 INFO L93 Difference]: Finished difference Result 325 states and 363 transitions. [2021-10-28 23:27:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 23:27:08,799 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-10-28 23:27:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:08,802 INFO L225 Difference]: With dead ends: 325 [2021-10-28 23:27:08,802 INFO L226 Difference]: Without dead ends: 325 [2021-10-28 23:27:08,803 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-10-28 23:27:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-10-28 23:27:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 228. [2021-10-28 23:27:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 191 states have (on average 1.3979057591623036) internal successors, (267), 224 states have internal predecessors, (267), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2021-10-28 23:27:08,813 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 33 [2021-10-28 23:27:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:08,813 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2021-10-28 23:27:08,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2021-10-28 23:27:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 23:27:08,815 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:08,815 INFO L513 BasicCegarLoop]: trace histogram [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-10-28 23:27:08,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 23:27:08,816 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr46REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash -49345090, now seen corresponding path program 1 times [2021-10-28 23:27:08,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:08,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122021656] [2021-10-28 23:27:08,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:08,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:08,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:08,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:08,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122021656] [2021-10-28 23:27:08,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122021656] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:27:08,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210892174] [2021-10-28 23:27:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:08,945 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:27:08,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:27:08,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:27:08,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 23:27:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:09,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-28 23:27:09,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:27:09,304 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 11 treesize of output 7 [2021-10-28 23:27:09,312 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 11 treesize of output 7 [2021-10-28 23:27:09,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 23:27:09,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-28 23:27:09,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 23:27:09,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-28 23:27:10,191 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-10-28 23:27:10,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 40 [2021-10-28 23:27:10,217 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-10-28 23:27:10,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 22 [2021-10-28 23:27:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:10,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210892174] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:27:10,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:27:10,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2021-10-28 23:27:10,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147572572] [2021-10-28 23:27:10,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 23:27:10,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:10,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 23:27:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:27:10,243 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:11,070 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-10-28 23:27:11,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 23:27:11,070 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-10-28 23:27:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:11,073 INFO L225 Difference]: With dead ends: 381 [2021-10-28 23:27:11,073 INFO L226 Difference]: Without dead ends: 381 [2021-10-28 23:27:11,074 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-10-28 23:27:11,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-10-28 23:27:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 266. [2021-10-28 23:27:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 229 states have (on average 1.4017467248908297) internal successors, (321), 262 states have internal predecessors, (321), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2021-10-28 23:27:11,087 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 35 [2021-10-28 23:27:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:11,087 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2021-10-28 23:27:11,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2021-10-28 23:27:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 23:27:11,089 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:11,089 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:11,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-28 23:27:11,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:27:11,303 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:11,304 INFO L85 PathProgramCache]: Analyzing trace with hash -824345932, now seen corresponding path program 1 times [2021-10-28 23:27:11,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:11,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658446437] [2021-10-28 23:27:11,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:11,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:11,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:11,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:11,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658446437] [2021-10-28 23:27:11,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658446437] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:11,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:11,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:27:11,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710117182] [2021-10-28 23:27:11,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:27:11,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:11,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:27:11,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:27:11,419 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:11,763 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2021-10-28 23:27:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 23:27:11,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-10-28 23:27:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:11,767 INFO L225 Difference]: With dead ends: 265 [2021-10-28 23:27:11,767 INFO L226 Difference]: Without dead ends: 265 [2021-10-28 23:27:11,767 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:27:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-10-28 23:27:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-10-28 23:27:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 229 states have (on average 1.3973799126637554) internal successors, (320), 261 states have internal predecessors, (320), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 323 transitions. [2021-10-28 23:27:11,782 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 323 transitions. Word has length 37 [2021-10-28 23:27:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:11,782 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 323 transitions. [2021-10-28 23:27:11,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 323 transitions. [2021-10-28 23:27:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 23:27:11,784 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:11,784 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:11,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 23:27:11,786 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash -824345931, now seen corresponding path program 1 times [2021-10-28 23:27:11,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:11,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189635264] [2021-10-28 23:27:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:11,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:11,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:11,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189635264] [2021-10-28 23:27:11,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189635264] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:11,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:11,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:27:11,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474388409] [2021-10-28 23:27:11,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:27:11,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:27:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:27:11,906 INFO L87 Difference]: Start difference. First operand 265 states and 323 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:12,210 INFO L93 Difference]: Finished difference Result 264 states and 322 transitions. [2021-10-28 23:27:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 23:27:12,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-10-28 23:27:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:12,215 INFO L225 Difference]: With dead ends: 264 [2021-10-28 23:27:12,215 INFO L226 Difference]: Without dead ends: 264 [2021-10-28 23:27:12,216 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:27:12,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-28 23:27:12,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2021-10-28 23:27:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 260 states have internal predecessors, (319), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 322 transitions. [2021-10-28 23:27:12,226 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 322 transitions. Word has length 37 [2021-10-28 23:27:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:12,226 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 322 transitions. [2021-10-28 23:27:12,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 322 transitions. [2021-10-28 23:27:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 23:27:12,228 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:12,228 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:12,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 23:27:12,229 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:12,229 INFO L85 PathProgramCache]: Analyzing trace with hash 385741532, now seen corresponding path program 1 times [2021-10-28 23:27:12,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:12,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803145231] [2021-10-28 23:27:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:12,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:12,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:12,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:12,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803145231] [2021-10-28 23:27:12,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803145231] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:12,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:12,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 23:27:12,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802194320] [2021-10-28 23:27:12,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 23:27:12,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:12,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 23:27:12,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-28 23:27:12,426 INFO L87 Difference]: Start difference. First operand 264 states and 322 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:13,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:13,356 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2021-10-28 23:27:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 23:27:13,357 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-10-28 23:27:13,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:13,360 INFO L225 Difference]: With dead ends: 374 [2021-10-28 23:27:13,361 INFO L226 Difference]: Without dead ends: 374 [2021-10-28 23:27:13,361 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-28 23:27:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-10-28 23:27:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 265. [2021-10-28 23:27:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 261 states have internal predecessors, (317), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 320 transitions. [2021-10-28 23:27:13,373 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 320 transitions. Word has length 38 [2021-10-28 23:27:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:13,373 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 320 transitions. [2021-10-28 23:27:13,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 320 transitions. [2021-10-28 23:27:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 23:27:13,375 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:13,375 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:13,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 23:27:13,375 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr50REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash 385741533, now seen corresponding path program 1 times [2021-10-28 23:27:13,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:13,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257710021] [2021-10-28 23:27:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:13,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:13,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:13,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257710021] [2021-10-28 23:27:13,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257710021] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:13,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:13,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 23:27:13,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604199479] [2021-10-28 23:27:13,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 23:27:13,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:13,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 23:27:13,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-28 23:27:13,671 INFO L87 Difference]: Start difference. First operand 265 states and 320 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:14,755 INFO L93 Difference]: Finished difference Result 430 states and 478 transitions. [2021-10-28 23:27:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 23:27:14,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-10-28 23:27:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:14,759 INFO L225 Difference]: With dead ends: 430 [2021-10-28 23:27:14,759 INFO L226 Difference]: Without dead ends: 430 [2021-10-28 23:27:14,760 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2021-10-28 23:27:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-10-28 23:27:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 271. [2021-10-28 23:27:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 238 states have (on average 1.361344537815126) internal successors, (324), 267 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 327 transitions. [2021-10-28 23:27:14,771 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 327 transitions. Word has length 38 [2021-10-28 23:27:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:14,772 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 327 transitions. [2021-10-28 23:27:14,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 327 transitions. [2021-10-28 23:27:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 23:27:14,773 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:14,774 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:14,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 23:27:14,774 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:14,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2104055878, now seen corresponding path program 1 times [2021-10-28 23:27:14,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:14,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240248535] [2021-10-28 23:27:14,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:14,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:14,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:14,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:14,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240248535] [2021-10-28 23:27:14,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240248535] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:14,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:14,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:27:14,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354904673] [2021-10-28 23:27:14,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:27:14,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:14,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:27:14,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:14,830 INFO L87 Difference]: Start difference. First operand 271 states and 327 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:15,023 INFO L93 Difference]: Finished difference Result 273 states and 329 transitions. [2021-10-28 23:27:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:27:15,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-10-28 23:27:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:15,032 INFO L225 Difference]: With dead ends: 273 [2021-10-28 23:27:15,033 INFO L226 Difference]: Without dead ends: 273 [2021-10-28 23:27:15,033 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-28 23:27:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-10-28 23:27:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 240 states have (on average 1.3583333333333334) internal successors, (326), 269 states have internal predecessors, (326), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2021-10-28 23:27:15,044 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 39 [2021-10-28 23:27:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:15,044 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2021-10-28 23:27:15,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2021-10-28 23:27:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 23:27:15,045 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:15,046 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:15,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 23:27:15,046 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:15,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1003773134, now seen corresponding path program 1 times [2021-10-28 23:27:15,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:15,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227673510] [2021-10-28 23:27:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:15,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:27:15,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:15,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227673510] [2021-10-28 23:27:15,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227673510] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:15,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:15,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:27:15,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834453141] [2021-10-28 23:27:15,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 23:27:15,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:15,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 23:27:15,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:27:15,240 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:15,592 INFO L93 Difference]: Finished difference Result 288 states and 344 transitions. [2021-10-28 23:27:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 23:27:15,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-28 23:27:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:15,601 INFO L225 Difference]: With dead ends: 288 [2021-10-28 23:27:15,602 INFO L226 Difference]: Without dead ends: 288 [2021-10-28 23:27:15,602 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-28 23:27:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-28 23:27:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2021-10-28 23:27:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 278 states have internal predecessors, (335), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 338 transitions. [2021-10-28 23:27:15,612 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 338 transitions. Word has length 40 [2021-10-28 23:27:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:15,612 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 338 transitions. [2021-10-28 23:27:15,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 338 transitions. [2021-10-28 23:27:15,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 23:27:15,614 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:15,614 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:15,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-28 23:27:15,615 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash 533473399, now seen corresponding path program 1 times [2021-10-28 23:27:15,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:15,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216006511] [2021-10-28 23:27:15,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:15,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:15,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:15,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:15,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216006511] [2021-10-28 23:27:15,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216006511] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:15,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:15,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:27:15,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611959901] [2021-10-28 23:27:15,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:27:15,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:15,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:27:15,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:27:15,753 INFO L87 Difference]: Start difference. First operand 282 states and 338 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:16,212 INFO L93 Difference]: Finished difference Result 282 states and 338 transitions. [2021-10-28 23:27:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 23:27:16,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-28 23:27:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:16,215 INFO L225 Difference]: With dead ends: 282 [2021-10-28 23:27:16,215 INFO L226 Difference]: Without dead ends: 282 [2021-10-28 23:27:16,216 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-28 23:27:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-28 23:27:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2021-10-28 23:27:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 249 states have (on average 1.3413654618473896) internal successors, (334), 277 states have internal predecessors, (334), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 337 transitions. [2021-10-28 23:27:16,238 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 337 transitions. Word has length 40 [2021-10-28 23:27:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:16,238 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 337 transitions. [2021-10-28 23:27:16,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 337 transitions. [2021-10-28 23:27:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 23:27:16,240 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:16,240 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:16,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-28 23:27:16,240 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:16,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash 533473400, now seen corresponding path program 1 times [2021-10-28 23:27:16,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:16,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168748985] [2021-10-28 23:27:16,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:16,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:16,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:16,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168748985] [2021-10-28 23:27:16,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168748985] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:16,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:16,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:27:16,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743160698] [2021-10-28 23:27:16,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:27:16,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:27:16,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:27:16,471 INFO L87 Difference]: Start difference. First operand 281 states and 337 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:17,038 INFO L93 Difference]: Finished difference Result 281 states and 337 transitions. [2021-10-28 23:27:17,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 23:27:17,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-28 23:27:17,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:17,042 INFO L225 Difference]: With dead ends: 281 [2021-10-28 23:27:17,042 INFO L226 Difference]: Without dead ends: 281 [2021-10-28 23:27:17,042 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-28 23:27:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-10-28 23:27:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2021-10-28 23:27:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3373493975903614) internal successors, (333), 276 states have internal predecessors, (333), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 336 transitions. [2021-10-28 23:27:17,052 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 336 transitions. Word has length 40 [2021-10-28 23:27:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:17,053 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 336 transitions. [2021-10-28 23:27:17,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 336 transitions. [2021-10-28 23:27:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 23:27:17,054 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:17,055 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:17,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-28 23:27:17,055 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr51ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:17,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:17,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1330432764, now seen corresponding path program 1 times [2021-10-28 23:27:17,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:17,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587606862] [2021-10-28 23:27:17,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:17,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:17,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:17,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:17,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587606862] [2021-10-28 23:27:17,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587606862] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:17,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:17,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 23:27:17,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417168867] [2021-10-28 23:27:17,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 23:27:17,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:17,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 23:27:17,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-10-28 23:27:17,485 INFO L87 Difference]: Start difference. First operand 280 states and 336 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:18,873 INFO L93 Difference]: Finished difference Result 448 states and 489 transitions. [2021-10-28 23:27:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-28 23:27:18,874 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-28 23:27:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:18,877 INFO L225 Difference]: With dead ends: 448 [2021-10-28 23:27:18,878 INFO L226 Difference]: Without dead ends: 448 [2021-10-28 23:27:18,878 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-10-28 23:27:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-10-28 23:27:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 280. [2021-10-28 23:27:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3333333333333333) internal successors, (332), 276 states have internal predecessors, (332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2021-10-28 23:27:18,895 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 40 [2021-10-28 23:27:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:18,896 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2021-10-28 23:27:18,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2021-10-28 23:27:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 23:27:18,897 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:18,898 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:18,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-28 23:27:18,898 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:18,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -930257781, now seen corresponding path program 1 times [2021-10-28 23:27:18,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:18,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502412871] [2021-10-28 23:27:18,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:18,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:19,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:19,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:19,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502412871] [2021-10-28 23:27:19,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502412871] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:19,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:19,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:27:19,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975565234] [2021-10-28 23:27:19,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 23:27:19,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:19,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 23:27:19,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:27:19,042 INFO L87 Difference]: Start difference. First operand 280 states and 335 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:19,499 INFO L93 Difference]: Finished difference Result 290 states and 346 transitions. [2021-10-28 23:27:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 23:27:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-10-28 23:27:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:19,502 INFO L225 Difference]: With dead ends: 290 [2021-10-28 23:27:19,502 INFO L226 Difference]: Without dead ends: 290 [2021-10-28 23:27:19,503 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-28 23:27:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-28 23:27:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 276. [2021-10-28 23:27:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 246 states have (on average 1.329268292682927) internal successors, (327), 272 states have internal predecessors, (327), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 330 transitions. [2021-10-28 23:27:19,513 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 330 transitions. Word has length 41 [2021-10-28 23:27:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:19,514 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 330 transitions. [2021-10-28 23:27:19,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 330 transitions. [2021-10-28 23:27:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 23:27:19,516 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:19,516 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:19,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-28 23:27:19,517 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr77ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:19,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1804534839, now seen corresponding path program 1 times [2021-10-28 23:27:19,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:19,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219412255] [2021-10-28 23:27:19,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:19,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:19,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:27:19,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:19,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219412255] [2021-10-28 23:27:19,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219412255] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:19,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:19,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:27:19,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474009542] [2021-10-28 23:27:19,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:27:19,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:19,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:27:19,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:19,586 INFO L87 Difference]: Start difference. First operand 276 states and 330 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:19,840 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2021-10-28 23:27:19,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:27:19,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2021-10-28 23:27:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:19,843 INFO L225 Difference]: With dead ends: 289 [2021-10-28 23:27:19,843 INFO L226 Difference]: Without dead ends: 289 [2021-10-28 23:27:19,843 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-28 23:27:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2021-10-28 23:27:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3279352226720649) internal successors, (328), 273 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2021-10-28 23:27:19,854 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 42 [2021-10-28 23:27:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:19,854 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2021-10-28 23:27:19,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2021-10-28 23:27:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-28 23:27:19,856 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:19,856 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:19,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-28 23:27:19,873 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr54ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash 968459560, now seen corresponding path program 1 times [2021-10-28 23:27:19,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:19,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665837382] [2021-10-28 23:27:19,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:19,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:20,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:20,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-10-28 23:27:20,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:20,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665837382] [2021-10-28 23:27:20,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665837382] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:20,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:20,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 23:27:20,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707332446] [2021-10-28 23:27:20,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 23:27:20,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:20,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 23:27:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-10-28 23:27:20,286 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:21,731 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2021-10-28 23:27:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-28 23:27:21,732 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-10-28 23:27:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:21,735 INFO L225 Difference]: With dead ends: 428 [2021-10-28 23:27:21,735 INFO L226 Difference]: Without dead ends: 428 [2021-10-28 23:27:21,737 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-10-28 23:27:21,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-10-28 23:27:21,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 277. [2021-10-28 23:27:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3238866396761133) internal successors, (327), 273 states have internal predecessors, (327), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2021-10-28 23:27:21,752 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 43 [2021-10-28 23:27:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:21,752 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2021-10-28 23:27:21,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2021-10-28 23:27:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-28 23:27:21,754 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:21,754 INFO L513 BasicCegarLoop]: trace histogram [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-10-28 23:27:21,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-28 23:27:21,755 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:21,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1207787386, now seen corresponding path program 1 times [2021-10-28 23:27:21,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:21,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118971540] [2021-10-28 23:27:21,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:21,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:21,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:27:21,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:21,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118971540] [2021-10-28 23:27:21,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118971540] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:27:21,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870538703] [2021-10-28 23:27:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:21,994 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:27:21,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:27:21,999 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:27:22,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-28 23:27:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:22,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-28 23:27:22,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:27:22,294 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 11 treesize of output 7 [2021-10-28 23:27:22,300 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 11 treesize of output 7 [2021-10-28 23:27:22,373 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-10-28 23:27:22,373 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 21 treesize of output 20 [2021-10-28 23:27:22,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 23:27:22,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-28 23:27:22,929 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-28 23:27:22,930 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 47 treesize of output 33 [2021-10-28 23:27:22,937 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-28 23:27:22,938 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 27 treesize of output 13 [2021-10-28 23:27:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:27:22,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870538703] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:27:22,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:27:22,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2021-10-28 23:27:22,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882704852] [2021-10-28 23:27:22,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 23:27:22,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:22,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 23:27:22,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:27:22,995 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:23,868 INFO L93 Difference]: Finished difference Result 409 states and 450 transitions. [2021-10-28 23:27:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 23:27:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-10-28 23:27:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:23,871 INFO L225 Difference]: With dead ends: 409 [2021-10-28 23:27:23,872 INFO L226 Difference]: Without dead ends: 409 [2021-10-28 23:27:23,872 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-10-28 23:27:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-10-28 23:27:23,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 301. [2021-10-28 23:27:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 271 states have (on average 1.3357933579335792) internal successors, (362), 297 states have internal predecessors, (362), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 365 transitions. [2021-10-28 23:27:23,884 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 365 transitions. Word has length 45 [2021-10-28 23:27:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:23,885 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 365 transitions. [2021-10-28 23:27:23,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 365 transitions. [2021-10-28 23:27:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-28 23:27:23,886 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:23,886 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:23,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-10-28 23:27:24,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-10-28 23:27:24,099 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1891470081, now seen corresponding path program 1 times [2021-10-28 23:27:24,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:24,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768051501] [2021-10-28 23:27:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:24,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:27:24,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:24,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768051501] [2021-10-28 23:27:24,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768051501] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:24,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:24,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:27:24,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210066831] [2021-10-28 23:27:24,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:27:24,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:24,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:27:24,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:24,163 INFO L87 Difference]: Start difference. First operand 301 states and 365 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:24,437 INFO L93 Difference]: Finished difference Result 303 states and 365 transitions. [2021-10-28 23:27:24,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:27:24,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-10-28 23:27:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:24,440 INFO L225 Difference]: With dead ends: 303 [2021-10-28 23:27:24,440 INFO L226 Difference]: Without dead ends: 303 [2021-10-28 23:27:24,441 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:27:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-10-28 23:27:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-10-28 23:27:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 270 states have (on average 1.325925925925926) internal successors, (358), 295 states have internal predecessors, (358), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2021-10-28 23:27:24,450 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 45 [2021-10-28 23:27:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:24,451 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2021-10-28 23:27:24,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2021-10-28 23:27:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-28 23:27:24,452 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:24,452 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:24,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-28 23:27:24,453 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr79ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:24,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:24,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1213297892, now seen corresponding path program 1 times [2021-10-28 23:27:24,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:24,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92316514] [2021-10-28 23:27:24,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:24,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:24,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:27:24,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:24,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92316514] [2021-10-28 23:27:24,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92316514] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:27:24,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562992796] [2021-10-28 23:27:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:24,531 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:27:24,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:27:24,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:27:24,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-28 23:27:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:24,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-28 23:27:24,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:27:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:27:25,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562992796] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:27:25,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:27:25,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-10-28 23:27:25,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706267872] [2021-10-28 23:27:25,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:27:25,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:25,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:27:25,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:27:25,233 INFO L87 Difference]: Start difference. First operand 299 states and 361 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:25,617 INFO L93 Difference]: Finished difference Result 330 states and 392 transitions. [2021-10-28 23:27:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:27:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-10-28 23:27:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:25,620 INFO L225 Difference]: With dead ends: 330 [2021-10-28 23:27:25,620 INFO L226 Difference]: Without dead ends: 306 [2021-10-28 23:27:25,621 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:27:25,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-28 23:27:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-10-28 23:27:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 277 states have (on average 1.3176895306859207) internal successors, (365), 302 states have internal predecessors, (365), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 368 transitions. [2021-10-28 23:27:25,631 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 368 transitions. Word has length 46 [2021-10-28 23:27:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:25,631 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 368 transitions. [2021-10-28 23:27:25,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 368 transitions. [2021-10-28 23:27:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-28 23:27:25,633 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:25,633 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:25,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-28 23:27:25,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-10-28 23:27:25,847 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr65REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:25,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1493965183, now seen corresponding path program 1 times [2021-10-28 23:27:25,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:25,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528753456] [2021-10-28 23:27:25,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:25,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:26,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:27:26,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:26,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528753456] [2021-10-28 23:27:26,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528753456] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:26,047 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:26,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 23:27:26,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279926046] [2021-10-28 23:27:26,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 23:27:26,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:26,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 23:27:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:27:26,051 INFO L87 Difference]: Start difference. First operand 306 states and 368 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:26,776 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-10-28 23:27:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 23:27:26,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-10-28 23:27:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:26,778 INFO L225 Difference]: With dead ends: 349 [2021-10-28 23:27:26,778 INFO L226 Difference]: Without dead ends: 349 [2021-10-28 23:27:26,779 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-10-28 23:27:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-10-28 23:27:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 313. [2021-10-28 23:27:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 284 states have (on average 1.3169014084507042) internal successors, (374), 309 states have internal predecessors, (374), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 377 transitions. [2021-10-28 23:27:26,787 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 377 transitions. Word has length 46 [2021-10-28 23:27:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:26,788 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 377 transitions. [2021-10-28 23:27:26,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 377 transitions. [2021-10-28 23:27:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-28 23:27:26,789 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:26,789 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:26,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-28 23:27:26,790 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr66REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:26,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1493965182, now seen corresponding path program 1 times [2021-10-28 23:27:26,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:26,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117647436] [2021-10-28 23:27:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:26,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:27,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:27:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:27:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:27:27,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:27:27,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117647436] [2021-10-28 23:27:27,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117647436] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:27:27,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:27:27,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 23:27:27,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66376470] [2021-10-28 23:27:27,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 23:27:27,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:27:27,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 23:27:27,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-28 23:27:27,058 INFO L87 Difference]: Start difference. First operand 313 states and 377 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:27:27,905 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-10-28 23:27:27,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 23:27:27,905 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-10-28 23:27:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:27:27,908 INFO L225 Difference]: With dead ends: 349 [2021-10-28 23:27:27,908 INFO L226 Difference]: Without dead ends: 349 [2021-10-28 23:27:27,910 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-10-28 23:27:27,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-10-28 23:27:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 319. [2021-10-28 23:27:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 290 states have (on average 1.313793103448276) internal successors, (381), 315 states have internal predecessors, (381), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2021-10-28 23:27:27,920 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 46 [2021-10-28 23:27:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:27:27,921 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2021-10-28 23:27:27,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:27:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2021-10-28 23:27:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 23:27:27,922 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:27:27,923 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:27,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-28 23:27:27,923 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr57REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-28 23:27:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:27:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash 292246064, now seen corresponding path program 1 times [2021-10-28 23:27:27,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:27:27,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670186281] [2021-10-28 23:27:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:27:27,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:27:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:27:27,956 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:27:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:27:28,044 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:27:28,045 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 23:27:28,047 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr57REQUIRES_VIOLATION [2021-10-28 23:27:28,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-10-28 23:27:28,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-10-28 23:27:28,051 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,051 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-10-28 23:27:28,051 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-10-28 23:27:28,051 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-10-28 23:27:28,052 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-10-28 23:27:28,052 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-10-28 23:27:28,052 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-10-28 23:27:28,052 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-10-28 23:27:28,053 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-10-28 23:27:28,053 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-10-28 23:27:28,053 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-10-28 23:27:28,053 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-10-28 23:27:28,053 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-10-28 23:27:28,054 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-10-28 23:27:28,054 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-10-28 23:27:28,054 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-10-28 23:27:28,054 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-10-28 23:27:28,055 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,055 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-10-28 23:27:28,055 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-10-28 23:27:28,055 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-10-28 23:27:28,055 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-10-28 23:27:28,056 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-10-28 23:27:28,056 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-10-28 23:27:28,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-10-28 23:27:28,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-10-28 23:27:28,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-10-28 23:27:28,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-10-28 23:27:28,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-10-28 23:27:28,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-10-28 23:27:28,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-10-28 23:27:28,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-10-28 23:27:28,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-10-28 23:27:28,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-10-28 23:27:28,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-10-28 23:27:28,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-10-28 23:27:28,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-10-28 23:27:28,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-10-28 23:27:28,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-10-28 23:27:28,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-10-28 23:27:28,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-10-28 23:27:28,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-10-28 23:27:28,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-10-28 23:27:28,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-10-28 23:27:28,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-10-28 23:27:28,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-10-28 23:27:28,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-10-28 23:27:28,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-10-28 23:27:28,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-10-28 23:27:28,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-10-28 23:27:28,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-10-28 23:27:28,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-10-28 23:27:28,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION [2021-10-28 23:27:28,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-10-28 23:27:28,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-10-28 23:27:28,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION [2021-10-28 23:27:28,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-10-28 23:27:28,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:27:28,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:27:28,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:27:28,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION [2021-10-28 23:27:28,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION [2021-10-28 23:27:28,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:27:28,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:27:28,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:27:28,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79ENSURES_VIOLATIONMEMORY_LEAK [2021-10-28 23:27:28,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-28 23:27:28,075 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:27:28,081 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:27:28,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:27:28 BoogieIcfgContainer [2021-10-28 23:27:28,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:27:28,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:27:28,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:27:28,169 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:27:28,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:26:56" (3/4) ... [2021-10-28 23:27:28,173 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 23:27:28,229 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:27:28,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:27:28,230 INFO L168 Benchmark]: Toolchain (without parser) took 33487.94 ms. Allocated memory was 96.5 MB in the beginning and 172.0 MB in the end (delta: 75.5 MB). Free memory was 57.8 MB in the beginning and 111.4 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:27:28,231 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 96.5 MB. Free memory is still 75.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:27:28,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.46 ms. Allocated memory is still 96.5 MB. Free memory was 57.6 MB in the beginning and 63.0 MB in the end (delta: -5.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:27:28,232 INFO L168 Benchmark]: Boogie Preprocessor took 121.04 ms. Allocated memory is still 96.5 MB. Free memory was 62.8 MB in the beginning and 59.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:27:28,233 INFO L168 Benchmark]: RCFGBuilder took 1214.37 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 59.5 MB in the beginning and 78.8 MB in the end (delta: -19.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 16.1 GB. [2021-10-28 23:27:28,233 INFO L168 Benchmark]: TraceAbstraction took 31381.41 ms. Allocated memory was 117.4 MB in the beginning and 172.0 MB in the end (delta: 54.5 MB). Free memory was 78.3 MB in the beginning and 113.5 MB in the end (delta: -35.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-28 23:27:28,234 INFO L168 Benchmark]: Witness Printer took 60.30 ms. Allocated memory is still 172.0 MB. Free memory was 113.5 MB in the beginning and 111.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:27:28,237 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.39 ms. Allocated memory is still 96.5 MB. Free memory is still 75.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 695.46 ms. Allocated memory is still 96.5 MB. Free memory was 57.6 MB in the beginning and 63.0 MB in the end (delta: -5.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 121.04 ms. Allocated memory is still 96.5 MB. Free memory was 62.8 MB in the beginning and 59.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1214.37 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 59.5 MB in the beginning and 78.8 MB in the end (delta: -19.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 31381.41 ms. Allocated memory was 117.4 MB in the beginning and 172.0 MB in the end (delta: 54.5 MB). Free memory was 78.3 MB in the beginning and 113.5 MB in the end (delta: -35.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Witness Printer took 60.30 ms. Allocated memory is still 172.0 MB. Free memory was 113.5 MB in the beginning and 111.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1038] inner = inner->inner [L1039] COND TRUE len == 1 VAL [end={-1:0}, inner={0:0}, len=1, list={-1:0}] [L1040] inner->inner - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 203 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 31.2s, OverallIterations: 38, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5010 SDtfs, 6834 SDslu, 14758 SDs, 0 SdLazy, 16128 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=37, InterpolantAutomatonStates: 351, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 1401 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1220 ConstructedInterpolants, 3 QuantifiedInterpolants, 11356 SizeOfPredicates, 13 NumberOfNonLiveVariables, 583 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 12/19 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 RESULT: Ultimate proved your program to be incorrect! [2021-10-28 23:27:28,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a751b0a9-9200-4acc-afca-a0e4b4e89512/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...