./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db17479a00afa98e4ce70a37e790a923b748e4dc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:26:09,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:26:09,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:26:09,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:26:09,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:26:09,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:26:09,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:26:09,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:26:09,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:26:09,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:26:09,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:26:09,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:26:09,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:26:09,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:26:09,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:26:09,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:26:09,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:26:09,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:26:09,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:26:09,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:26:09,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:26:09,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:26:09,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:26:09,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:26:09,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:26:09,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:26:09,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:26:09,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:26:09,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:26:09,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:26:09,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:26:09,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:26:09,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:26:09,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:26:09,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:26:09,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:26:09,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:26:09,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:26:09,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:26:09,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:26:09,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:26:09,613 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 10:26:09,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:26:09,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:26:09,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:26:09,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:26:09,626 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:26:09,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:26:09,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:26:09,627 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:26:09,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:26:09,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:26:09,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:26:09,628 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 10:26:09,628 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 10:26:09,628 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 10:26:09,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:26:09,629 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:26:09,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:26:09,629 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:26:09,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:26:09,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:26:09,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:26:09,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:26:09,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:26:09,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:26:09,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:26:09,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:26:09,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:26:09,631 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:26:09,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db17479a00afa98e4ce70a37e790a923b748e4dc [2019-12-07 10:26:09,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:26:09,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:26:09,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:26:09,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:26:09,741 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:26:09,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-12-07 10:26:09,777 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/data/976ef854e/a511be683ce248caadf778a754560a18/FLAG4432719e9 [2019-12-07 10:26:10,237 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:26:10,237 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-12-07 10:26:10,246 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/data/976ef854e/a511be683ce248caadf778a754560a18/FLAG4432719e9 [2019-12-07 10:26:10,254 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/data/976ef854e/a511be683ce248caadf778a754560a18 [2019-12-07 10:26:10,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:26:10,257 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 10:26:10,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:26:10,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:26:10,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:26:10,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:26:10" (1/1) ... [2019-12-07 10:26:10,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb9d963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:10, skipping insertion in model container [2019-12-07 10:26:10,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:26:10" (1/1) ... [2019-12-07 10:26:10,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:26:10,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:26:10,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:26:10,531 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:26:10,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:26:10,596 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:26:10,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:10 WrapperNode [2019-12-07 10:26:10,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:26:10,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:26:10,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:26:10,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:26:10,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:10" (1/1) ... [2019-12-07 10:26:10,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:10" (1/1) ... [2019-12-07 10:26:10,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:10" (1/1) ... [2019-12-07 10:26:10,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:10" (1/1) ... [2019-12-07 10:26:10,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:10" (1/1) ... [2019-12-07 10:26:10,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:10" (1/1) ... [2019-12-07 10:26:10,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:10" (1/1) ... [2019-12-07 10:26:10,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:26:10,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:26:10,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:26:10,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:26:10,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:26:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 10:26:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:26:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 10:26:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 10:26:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 10:26:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-12-07 10:26:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-12-07 10:26:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-12-07 10:26:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2019-12-07 10:26:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2019-12-07 10:26:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 10:26:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 10:26:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 10:26:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 10:26:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 10:26:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 10:26:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 10:26:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 10:26:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 10:26:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 10:26:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 10:26:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 10:26:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 10:26:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 10:26:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:26:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2019-12-07 10:26:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:26:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2019-12-07 10:26:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 10:26:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 10:26:10,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:26:10,867 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 10:26:11,012 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:26:11,012 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 10:26:11,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:26:11 BoogieIcfgContainer [2019-12-07 10:26:11,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:26:11,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:26:11,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:26:11,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:26:11,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:26:10" (1/3) ... [2019-12-07 10:26:11,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575e8855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:26:11, skipping insertion in model container [2019-12-07 10:26:11,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:10" (2/3) ... [2019-12-07 10:26:11,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575e8855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:26:11, skipping insertion in model container [2019-12-07 10:26:11,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:26:11" (3/3) ... [2019-12-07 10:26:11,019 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2019-12-07 10:26:11,028 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:26:11,034 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-12-07 10:26:11,042 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-12-07 10:26:11,055 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:26:11,055 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 10:26:11,055 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:26:11,055 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:26:11,055 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:26:11,055 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:26:11,055 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:26:11,055 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:26:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2019-12-07 10:26:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 10:26:11,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:11,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:11,074 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:11,077 INFO L82 PathProgramCache]: Analyzing trace with hash -60425913, now seen corresponding path program 1 times [2019-12-07 10:26:11,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:11,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744091154] [2019-12-07 10:26:11,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:26:11,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744091154] [2019-12-07 10:26:11,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:11,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:26:11,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618010430] [2019-12-07 10:26:11,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:26:11,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:11,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:26:11,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:26:11,225 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 4 states. [2019-12-07 10:26:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:11,414 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2019-12-07 10:26:11,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:26:11,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 10:26:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:11,423 INFO L225 Difference]: With dead ends: 121 [2019-12-07 10:26:11,423 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 10:26:11,424 INFO L630 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 [2019-12-07 10:26:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 10:26:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2019-12-07 10:26:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 10:26:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2019-12-07 10:26:11,455 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 12 [2019-12-07 10:26:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:11,455 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2019-12-07 10:26:11,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:26:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2019-12-07 10:26:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 10:26:11,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:11,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:11,456 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:11,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:11,457 INFO L82 PathProgramCache]: Analyzing trace with hash -60425912, now seen corresponding path program 1 times [2019-12-07 10:26:11,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:11,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593734997] [2019-12-07 10:26:11,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:26:11,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593734997] [2019-12-07 10:26:11,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:11,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:26:11,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650834603] [2019-12-07 10:26:11,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:26:11,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:11,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:26:11,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:26:11,516 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 4 states. [2019-12-07 10:26:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:11,645 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-12-07 10:26:11,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:26:11,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 10:26:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:11,647 INFO L225 Difference]: With dead ends: 113 [2019-12-07 10:26:11,647 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 10:26:11,647 INFO L630 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 [2019-12-07 10:26:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 10:26:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2019-12-07 10:26:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 10:26:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-12-07 10:26:11,655 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 12 [2019-12-07 10:26:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:11,655 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-12-07 10:26:11,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:26:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-12-07 10:26:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:26:11,656 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:11,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:11,656 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:11,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:11,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2117576354, now seen corresponding path program 1 times [2019-12-07 10:26:11,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:11,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145289493] [2019-12-07 10:26:11,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:26:11,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145289493] [2019-12-07 10:26:11,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:11,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:26:11,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058933909] [2019-12-07 10:26:11,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:26:11,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:11,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:26:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:26:11,757 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 8 states. [2019-12-07 10:26:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:12,048 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-12-07 10:26:12,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:26:12,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 10:26:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:12,051 INFO L225 Difference]: With dead ends: 117 [2019-12-07 10:26:12,051 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 10:26:12,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:26:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 10:26:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2019-12-07 10:26:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 10:26:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2019-12-07 10:26:12,062 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 19 [2019-12-07 10:26:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:12,062 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2019-12-07 10:26:12,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:26:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2019-12-07 10:26:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:26:12,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:12,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:12,064 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:12,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:12,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2117576353, now seen corresponding path program 1 times [2019-12-07 10:26:12,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:12,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082431479] [2019-12-07 10:26:12,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:26:12,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082431479] [2019-12-07 10:26:12,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:12,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:26:12,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80269394] [2019-12-07 10:26:12,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:26:12,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:26:12,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:26:12,149 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 7 states. [2019-12-07 10:26:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:12,388 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-12-07 10:26:12,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:26:12,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-07 10:26:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:12,389 INFO L225 Difference]: With dead ends: 114 [2019-12-07 10:26:12,389 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 10:26:12,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:26:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 10:26:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2019-12-07 10:26:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 10:26:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2019-12-07 10:26:12,396 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 19 [2019-12-07 10:26:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:12,397 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2019-12-07 10:26:12,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:26:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2019-12-07 10:26:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:26:12,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:12,398 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:12,398 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:12,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:12,399 INFO L82 PathProgramCache]: Analyzing trace with hash 298301399, now seen corresponding path program 1 times [2019-12-07 10:26:12,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:12,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867254471] [2019-12-07 10:26:12,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:26:12,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867254471] [2019-12-07 10:26:12,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:12,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:26:12,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356890615] [2019-12-07 10:26:12,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:26:12,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:12,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:26:12,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:26:12,480 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 8 states. [2019-12-07 10:26:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:12,732 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2019-12-07 10:26:12,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:26:12,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 10:26:12,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:12,733 INFO L225 Difference]: With dead ends: 114 [2019-12-07 10:26:12,733 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 10:26:12,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:26:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 10:26:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2019-12-07 10:26:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 10:26:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-12-07 10:26:12,738 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 28 [2019-12-07 10:26:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:12,739 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-12-07 10:26:12,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:26:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-12-07 10:26:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:26:12,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:12,739 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:12,740 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:12,740 INFO L82 PathProgramCache]: Analyzing trace with hash 298301400, now seen corresponding path program 1 times [2019-12-07 10:26:12,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:12,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636954886] [2019-12-07 10:26:12,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:26:12,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636954886] [2019-12-07 10:26:12,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:12,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:26:12,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723477609] [2019-12-07 10:26:12,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:26:12,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:12,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:26:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:26:12,832 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 8 states. [2019-12-07 10:26:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:13,088 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2019-12-07 10:26:13,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:26:13,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 10:26:13,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:13,089 INFO L225 Difference]: With dead ends: 113 [2019-12-07 10:26:13,089 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 10:26:13,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:26:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 10:26:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2019-12-07 10:26:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 10:26:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2019-12-07 10:26:13,096 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 28 [2019-12-07 10:26:13,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:13,096 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2019-12-07 10:26:13,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:26:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2019-12-07 10:26:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:26:13,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:13,097 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:13,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:13,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash 409760108, now seen corresponding path program 1 times [2019-12-07 10:26:13,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:13,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242014972] [2019-12-07 10:26:13,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:26:13,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242014972] [2019-12-07 10:26:13,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794213117] [2019-12-07 10:26:13,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:13,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 10:26:13,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:26:13,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:26:13,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:13,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2019-12-07 10:26:13,418 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:13,428 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:26:13,429 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:26:13,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 10:26:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:26:13,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:26:13,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-12-07 10:26:13,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789818029] [2019-12-07 10:26:13,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:26:13,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:13,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:26:13,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:26:13,439 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 12 states. [2019-12-07 10:26:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:13,890 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-12-07 10:26:13,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:26:13,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-12-07 10:26:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:13,891 INFO L225 Difference]: With dead ends: 127 [2019-12-07 10:26:13,891 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 10:26:13,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:26:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 10:26:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2019-12-07 10:26:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 10:26:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-12-07 10:26:13,896 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 31 [2019-12-07 10:26:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:13,896 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-12-07 10:26:13,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:26:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-12-07 10:26:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:26:13,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:13,897 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:14,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:14,098 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:14,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:14,099 INFO L82 PathProgramCache]: Analyzing trace with hash 409760109, now seen corresponding path program 1 times [2019-12-07 10:26:14,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:14,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959747403] [2019-12-07 10:26:14,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:26:14,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959747403] [2019-12-07 10:26:14,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871711531] [2019-12-07 10:26:14,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:14,314 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 10:26:14,317 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:26:14,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:26:14,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:14,322 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:14,322 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:26:14,323 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:26:14,429 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:14,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 33 [2019-12-07 10:26:14,430 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:14,442 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-12-07 10:26:14,443 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:26:14,443 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-12-07 10:26:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:26:14,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:26:14,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-07 10:26:14,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127826616] [2019-12-07 10:26:14,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:26:14,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:14,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:26:14,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:26:14,457 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 16 states. [2019-12-07 10:26:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:15,017 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-12-07 10:26:15,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:26:15,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-12-07 10:26:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:15,025 INFO L225 Difference]: With dead ends: 112 [2019-12-07 10:26:15,025 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 10:26:15,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:26:15,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 10:26:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-12-07 10:26:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 10:26:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-12-07 10:26:15,029 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 31 [2019-12-07 10:26:15,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:15,029 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-12-07 10:26:15,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:26:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-12-07 10:26:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:26:15,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:15,030 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:15,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:15,231 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:15,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash -719435029, now seen corresponding path program 1 times [2019-12-07 10:26:15,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:15,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004072737] [2019-12-07 10:26:15,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:26:15,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004072737] [2019-12-07 10:26:15,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:15,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 10:26:15,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192491139] [2019-12-07 10:26:15,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:26:15,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:15,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:26:15,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:26:15,369 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 14 states. [2019-12-07 10:26:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:15,846 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2019-12-07 10:26:15,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:26:15,847 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-12-07 10:26:15,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:15,848 INFO L225 Difference]: With dead ends: 119 [2019-12-07 10:26:15,848 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 10:26:15,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-12-07 10:26:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 10:26:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2019-12-07 10:26:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 10:26:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-12-07 10:26:15,852 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 40 [2019-12-07 10:26:15,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:15,852 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-12-07 10:26:15,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:26:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-12-07 10:26:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:26:15,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:15,853 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:15,853 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:15,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:15,854 INFO L82 PathProgramCache]: Analyzing trace with hash -719435028, now seen corresponding path program 1 times [2019-12-07 10:26:15,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:15,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228720727] [2019-12-07 10:26:15,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 10:26:15,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228720727] [2019-12-07 10:26:15,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:15,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:26:15,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457759425] [2019-12-07 10:26:15,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:26:15,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:15,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:26:15,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:26:15,922 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 8 states. [2019-12-07 10:26:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:16,192 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2019-12-07 10:26:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:26:16,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-07 10:26:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:16,193 INFO L225 Difference]: With dead ends: 136 [2019-12-07 10:26:16,193 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 10:26:16,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:26:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 10:26:16,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 106. [2019-12-07 10:26:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 10:26:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2019-12-07 10:26:16,197 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 40 [2019-12-07 10:26:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:16,197 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2019-12-07 10:26:16,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:26:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2019-12-07 10:26:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:26:16,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:16,198 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:16,198 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:16,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:16,198 INFO L82 PathProgramCache]: Analyzing trace with hash -719434973, now seen corresponding path program 1 times [2019-12-07 10:26:16,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:16,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285659144] [2019-12-07 10:26:16,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:26:16,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285659144] [2019-12-07 10:26:16,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:16,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 10:26:16,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290459362] [2019-12-07 10:26:16,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:26:16,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:16,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:26:16,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:26:16,364 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 14 states. [2019-12-07 10:26:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:16,943 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2019-12-07 10:26:16,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:26:16,943 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-12-07 10:26:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:16,944 INFO L225 Difference]: With dead ends: 130 [2019-12-07 10:26:16,944 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 10:26:16,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:26:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 10:26:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 106. [2019-12-07 10:26:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 10:26:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2019-12-07 10:26:16,949 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 40 [2019-12-07 10:26:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:16,949 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2019-12-07 10:26:16,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:26:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2019-12-07 10:26:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:26:16,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:16,950 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:16,951 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:16,951 INFO L82 PathProgramCache]: Analyzing trace with hash -800451940, now seen corresponding path program 1 times [2019-12-07 10:26:16,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:16,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100917408] [2019-12-07 10:26:16,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:26:17,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100917408] [2019-12-07 10:26:17,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27222419] [2019-12-07 10:26:17,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:17,281 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 10:26:17,284 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:26:17,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:17,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:26:17,322 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:17,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:17,326 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:26:17,326 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 10:26:17,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:26:17,329 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:17,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:17,332 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:26:17,332 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 10:26:17,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:17,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-12-07 10:26:17,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:26:17,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:17,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:17,375 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:26:17,375 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 10:26:17,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:17,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-12-07 10:26:17,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:17,576 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:17,577 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:26:17,577 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-12-07 10:26:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:26:17,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:26:17,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 29 [2019-12-07 10:26:17,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870138926] [2019-12-07 10:26:17,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 10:26:17,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:17,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 10:26:17,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2019-12-07 10:26:17,582 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 30 states. [2019-12-07 10:26:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:19,319 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2019-12-07 10:26:19,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 10:26:19,320 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2019-12-07 10:26:19,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:19,322 INFO L225 Difference]: With dead ends: 155 [2019-12-07 10:26:19,322 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 10:26:19,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=1717, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 10:26:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 10:26:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 125. [2019-12-07 10:26:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 10:26:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-12-07 10:26:19,331 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 43 [2019-12-07 10:26:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:19,332 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-12-07 10:26:19,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 10:26:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-12-07 10:26:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:26:19,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:19,333 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:19,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:19,535 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:19,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:19,535 INFO L82 PathProgramCache]: Analyzing trace with hash -800451939, now seen corresponding path program 1 times [2019-12-07 10:26:19,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:19,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996679069] [2019-12-07 10:26:19,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:26:19,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996679069] [2019-12-07 10:26:19,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305404840] [2019-12-07 10:26:19,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:20,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 76 conjunts are in the unsatisfiable core [2019-12-07 10:26:20,026 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:26:20,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:26:20,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 10:26:20,255 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:20,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:20,266 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:20,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:26:20,267 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:20,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:20,273 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:26:20,273 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-12-07 10:26:20,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:26:20,432 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:20,450 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:20,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:26:20,455 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:20,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:20,478 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:26:20,478 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2019-12-07 10:26:20,745 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:20,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 68 [2019-12-07 10:26:20,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:26:20,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:26:20,749 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:26:20,831 INFO L614 ElimStorePlain]: treesize reduction 60, result has 53.1 percent of original size [2019-12-07 10:26:20,837 INFO L377 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 44 treesize of output 35 [2019-12-07 10:26:20,838 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:20,862 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:20,863 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:26:20,863 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:60 [2019-12-07 10:26:21,268 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:21,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 44 [2019-12-07 10:26:21,269 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:21,277 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:21,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-12-07 10:26:21,279 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:21,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:21,284 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:26:21,284 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:22 [2019-12-07 10:26:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:26:21,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:26:21,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2019-12-07 10:26:21,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701296214] [2019-12-07 10:26:21,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 10:26:21,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:21,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 10:26:21,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1713, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 10:26:21,409 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 43 states. [2019-12-07 10:26:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:24,417 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2019-12-07 10:26:24,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 10:26:24,418 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-12-07 10:26:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:24,419 INFO L225 Difference]: With dead ends: 158 [2019-12-07 10:26:24,419 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 10:26:24,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=244, Invalid=3538, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 10:26:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 10:26:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 131. [2019-12-07 10:26:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-12-07 10:26:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2019-12-07 10:26:24,424 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 43 [2019-12-07 10:26:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:24,424 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2019-12-07 10:26:24,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 10:26:24,425 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2019-12-07 10:26:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 10:26:24,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:24,426 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:24,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:24,626 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:24,627 INFO L82 PathProgramCache]: Analyzing trace with hash -603627189, now seen corresponding path program 2 times [2019-12-07 10:26:24,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:24,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752072912] [2019-12-07 10:26:24,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 10:26:24,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752072912] [2019-12-07 10:26:24,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:24,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:26:24,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716680415] [2019-12-07 10:26:24,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:26:24,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:24,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:26:24,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:26:24,719 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand 9 states. [2019-12-07 10:26:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:24,986 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2019-12-07 10:26:24,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:26:24,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-12-07 10:26:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:24,988 INFO L225 Difference]: With dead ends: 141 [2019-12-07 10:26:24,988 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 10:26:24,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:26:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 10:26:24,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2019-12-07 10:26:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 10:26:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2019-12-07 10:26:24,993 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 46 [2019-12-07 10:26:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:24,993 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2019-12-07 10:26:24,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:26:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2019-12-07 10:26:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 10:26:24,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:24,994 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:24,995 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:24,995 INFO L82 PathProgramCache]: Analyzing trace with hash 243032845, now seen corresponding path program 1 times [2019-12-07 10:26:24,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:24,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915972984] [2019-12-07 10:26:24,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 10:26:25,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915972984] [2019-12-07 10:26:25,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:25,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:26:25,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802867575] [2019-12-07 10:26:25,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:26:25,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:25,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:26:25,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:26:25,130 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 15 states. [2019-12-07 10:26:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:25,606 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2019-12-07 10:26:25,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:26:25,607 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2019-12-07 10:26:25,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:25,608 INFO L225 Difference]: With dead ends: 149 [2019-12-07 10:26:25,608 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 10:26:25,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:26:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 10:26:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2019-12-07 10:26:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 10:26:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2019-12-07 10:26:25,611 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 53 [2019-12-07 10:26:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:25,611 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2019-12-07 10:26:25,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:26:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2019-12-07 10:26:25,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 10:26:25,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:25,612 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:25,612 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:25,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:25,613 INFO L82 PathProgramCache]: Analyzing trace with hash 243032846, now seen corresponding path program 1 times [2019-12-07 10:26:25,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:25,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521726505] [2019-12-07 10:26:25,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 10:26:25,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521726505] [2019-12-07 10:26:25,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620861340] [2019-12-07 10:26:25,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:25,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:26:25,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:26:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:26:25,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:26:25,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 18 [2019-12-07 10:26:25,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466944584] [2019-12-07 10:26:25,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 10:26:25,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:25,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 10:26:25,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:26:25,850 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand 18 states. [2019-12-07 10:26:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:26,398 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2019-12-07 10:26:26,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:26:26,398 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2019-12-07 10:26:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:26,399 INFO L225 Difference]: With dead ends: 155 [2019-12-07 10:26:26,399 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 10:26:26,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:26:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 10:26:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2019-12-07 10:26:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-07 10:26:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2019-12-07 10:26:26,404 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 53 [2019-12-07 10:26:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:26,404 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2019-12-07 10:26:26,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 10:26:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2019-12-07 10:26:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 10:26:26,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:26,405 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:26,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:26,606 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:26,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1587241385, now seen corresponding path program 1 times [2019-12-07 10:26:26,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:26,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050895006] [2019-12-07 10:26:26,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:26:26,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050895006] [2019-12-07 10:26:26,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137345620] [2019-12-07 10:26:26,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:26,801 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:26:26,803 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:26:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:26:26,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:26:26,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 10 [2019-12-07 10:26:26,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616895610] [2019-12-07 10:26:26,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:26:26,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:26,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:26:26,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:26:26,808 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand 7 states. [2019-12-07 10:26:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:26,858 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2019-12-07 10:26:26,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:26:26,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-07 10:26:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:26,859 INFO L225 Difference]: With dead ends: 130 [2019-12-07 10:26:26,859 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 10:26:26,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:26:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 10:26:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2019-12-07 10:26:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 10:26:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2019-12-07 10:26:26,862 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 54 [2019-12-07 10:26:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:26,862 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2019-12-07 10:26:26,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:26:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2019-12-07 10:26:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 10:26:26,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:26,863 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:27,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:27,064 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:27,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2093637802, now seen corresponding path program 3 times [2019-12-07 10:26:27,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:27,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234044472] [2019-12-07 10:26:27,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 10:26:27,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234044472] [2019-12-07 10:26:27,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581598876] [2019-12-07 10:26:27,171 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:27,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 10:26:27,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:26:27,267 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:26:27,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:26:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 10:26:27,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:26:27,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-12-07 10:26:27,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263019266] [2019-12-07 10:26:27,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:26:27,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:27,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:26:27,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:26:27,282 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand 9 states. [2019-12-07 10:26:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:27,549 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2019-12-07 10:26:27,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:26:27,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-07 10:26:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:27,550 INFO L225 Difference]: With dead ends: 134 [2019-12-07 10:26:27,550 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 10:26:27,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:26:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 10:26:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2019-12-07 10:26:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 10:26:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-12-07 10:26:27,553 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 55 [2019-12-07 10:26:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:27,554 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-12-07 10:26:27,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:26:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-12-07 10:26:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 10:26:27,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:27,554 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:27,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:27,755 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:27,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:27,755 INFO L82 PathProgramCache]: Analyzing trace with hash -696475518, now seen corresponding path program 2 times [2019-12-07 10:26:27,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:27,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376046948] [2019-12-07 10:26:27,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 10:26:27,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376046948] [2019-12-07 10:26:27,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:27,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:26:27,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628551873] [2019-12-07 10:26:27,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:26:27,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:27,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:26:27,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:26:27,874 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 9 states. [2019-12-07 10:26:28,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:28,143 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2019-12-07 10:26:28,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:26:28,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-12-07 10:26:28,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:28,144 INFO L225 Difference]: With dead ends: 141 [2019-12-07 10:26:28,145 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 10:26:28,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:26:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 10:26:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2019-12-07 10:26:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 10:26:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2019-12-07 10:26:28,147 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 61 [2019-12-07 10:26:28,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:28,148 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2019-12-07 10:26:28,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:26:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2019-12-07 10:26:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 10:26:28,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:28,148 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:28,148 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:28,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:28,149 INFO L82 PathProgramCache]: Analyzing trace with hash -696475463, now seen corresponding path program 1 times [2019-12-07 10:26:28,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:28,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507450330] [2019-12-07 10:26:28,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 10:26:28,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507450330] [2019-12-07 10:26:28,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:28,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:26:28,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827167049] [2019-12-07 10:26:28,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:26:28,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:26:28,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:26:28,307 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 15 states. [2019-12-07 10:26:28,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:28,840 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2019-12-07 10:26:28,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:26:28,840 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2019-12-07 10:26:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:28,841 INFO L225 Difference]: With dead ends: 140 [2019-12-07 10:26:28,841 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 10:26:28,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:26:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 10:26:28,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 116. [2019-12-07 10:26:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 10:26:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2019-12-07 10:26:28,844 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 61 [2019-12-07 10:26:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:28,844 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2019-12-07 10:26:28,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:26:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2019-12-07 10:26:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 10:26:28,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:28,844 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:28,845 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:26:28,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash 286598783, now seen corresponding path program 1 times [2019-12-07 10:26:28,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:28,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899908762] [2019-12-07 10:26:28,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:26:29,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899908762] [2019-12-07 10:26:29,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950392988] [2019-12-07 10:26:29,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:26:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:29,488 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 79 conjunts are in the unsatisfiable core [2019-12-07 10:26:29,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:26:29,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:29,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:26:29,574 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:29,576 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:29,576 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:26:29,577 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 10:26:29,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:26:29,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:26:29,634 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:29,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:26:29,634 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 10:26:29,703 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:29,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-12-07 10:26:29,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:26:29,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:26:29,705 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:26:29,716 INFO L614 ElimStorePlain]: treesize reduction 34, result has 46.0 percent of original size [2019-12-07 10:26:29,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:26:29,717 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 10:26:30,022 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:30,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-12-07 10:26:30,024 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:26:30,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:30,031 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:26:30,031 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:9 [2019-12-07 10:26:53,889 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 10:26:53,921 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:53,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 117 [2019-12-07 10:26:53,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:26:53,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:26:53,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:26:53,923 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:26:53,954 INFO L614 ElimStorePlain]: treesize reduction 120, result has 33.0 percent of original size [2019-12-07 10:26:53,955 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:26:53,955 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:54 [2019-12-07 10:26:55,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-12-07 10:26:55,083 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:26:55,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:26:55,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:26:55,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2019-12-07 10:27:13,671 WARN L192 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 10:27:13,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:27:13,677 INFO L377 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 37 treesize of output 17 [2019-12-07 10:27:13,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:13,683 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:13,683 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:27:13,683 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:23 [2019-12-07 10:27:17,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 10:27:17,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:27:17,225 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:27:17,225 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:27:17,225 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-12-07 10:27:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 13 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:27:17,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:27:17,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 50 [2019-12-07 10:27:17,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141952230] [2019-12-07 10:27:17,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-07 10:27:17,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:17,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-07 10:27:17,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2362, Unknown=43, NotChecked=0, Total=2550 [2019-12-07 10:27:17,237 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand 51 states. [2019-12-07 10:27:46,090 WARN L192 SmtUtils]: Spent 712.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 10:27:53,584 WARN L192 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 10:28:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:12,766 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2019-12-07 10:28:12,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 10:28:12,766 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 64 [2019-12-07 10:28:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:12,767 INFO L225 Difference]: With dead ends: 152 [2019-12-07 10:28:12,767 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 10:28:12,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 60.3s TimeCoverageRelationStatistics Valid=426, Invalid=4925, Unknown=51, NotChecked=0, Total=5402 [2019-12-07 10:28:12,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 10:28:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 124. [2019-12-07 10:28:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 10:28:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2019-12-07 10:28:12,772 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 64 [2019-12-07 10:28:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:12,773 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2019-12-07 10:28:12,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-07 10:28:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2019-12-07 10:28:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 10:28:12,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:12,774 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:12,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:28:12,975 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:28:12,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash 286598784, now seen corresponding path program 1 times [2019-12-07 10:28:12,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:12,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055066744] [2019-12-07 10:28:12,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:28:13,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055066744] [2019-12-07 10:28:13,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137919481] [2019-12-07 10:28:13,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:28:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:13,851 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 101 conjunts are in the unsatisfiable core [2019-12-07 10:28:13,853 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:28:14,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:28:14,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 10:28:14,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:14,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:14,136 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:14,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:28:14,136 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:14,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:14,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:14,141 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-12-07 10:28:14,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:28:14,238 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:14,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:14,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:28:14,248 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:14,255 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:14,256 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:14,256 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2019-12-07 10:28:14,392 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:14,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 68 [2019-12-07 10:28:14,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:28:14,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:28:14,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:28:14,425 INFO L614 ElimStorePlain]: treesize reduction 60, result has 49.6 percent of original size [2019-12-07 10:28:14,428 INFO L377 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 35 treesize of output 30 [2019-12-07 10:28:14,428 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:14,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:14,437 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:28:14,437 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2019-12-07 10:28:14,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:14,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2019-12-07 10:28:14,729 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:28:14,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:14,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-12-07 10:28:14,740 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:14,745 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:14,745 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:28:14,745 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:12 [2019-12-07 10:28:15,181 INFO L343 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2019-12-07 10:28:15,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2019-12-07 10:28:15,181 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:15,199 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:15,226 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:15,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 136 [2019-12-07 10:28:15,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:28:15,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:28:15,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:28:15,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:28:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:28:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:28:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:28:15,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:28:15,230 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2019-12-07 10:28:15,311 INFO L614 ElimStorePlain]: treesize reduction 359, result has 21.6 percent of original size [2019-12-07 10:28:15,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:28:15,313 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:28:15,313 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:130, output treesize:100 [2019-12-07 10:28:15,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-12-07 10:28:15,432 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:15,438 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:15,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-12-07 10:28:15,441 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:28:15,447 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:15,447 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:28:15,447 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:21 [2019-12-07 10:28:39,582 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 10:28:39,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:28:39,608 INFO L377 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 44 treesize of output 24 [2019-12-07 10:28:39,609 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:39,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:39,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:28:39,626 INFO L377 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 43 treesize of output 23 [2019-12-07 10:28:39,626 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:39,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:39,637 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:28:39,637 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:93, output treesize:52 [2019-12-07 10:28:39,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-12-07 10:28:39,867 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:39,874 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:39,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-12-07 10:28:39,876 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:39,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:39,881 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:28:39,881 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:22 [2019-12-07 10:28:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:28:40,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:28:40,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2019-12-07 10:28:40,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655361384] [2019-12-07 10:28:40,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-12-07 10:28:40,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:40,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-12-07 10:28:40,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3477, Unknown=13, NotChecked=0, Total=3660 [2019-12-07 10:28:40,053 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 61 states. [2019-12-07 10:28:52,934 WARN L192 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 10:28:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:57,696 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2019-12-07 10:28:57,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 10:28:57,696 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 64 [2019-12-07 10:28:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:57,697 INFO L225 Difference]: With dead ends: 155 [2019-12-07 10:28:57,697 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 10:28:57,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=535, Invalid=7276, Unknown=21, NotChecked=0, Total=7832 [2019-12-07 10:28:57,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 10:28:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2019-12-07 10:28:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 10:28:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2019-12-07 10:28:57,703 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 64 [2019-12-07 10:28:57,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:57,703 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2019-12-07 10:28:57,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-12-07 10:28:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2019-12-07 10:28:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:57,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:57,704 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:57,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:28:57,905 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:28:57,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:57,905 INFO L82 PathProgramCache]: Analyzing trace with hash -328861759, now seen corresponding path program 2 times [2019-12-07 10:28:57,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:57,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336185323] [2019-12-07 10:28:57,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 10:28:58,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336185323] [2019-12-07 10:28:58,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:58,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:28:58,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273204844] [2019-12-07 10:28:58,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:28:58,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:58,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:28:58,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:28:58,003 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand 10 states. [2019-12-07 10:28:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:58,273 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2019-12-07 10:28:58,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:28:58,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 10:28:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:58,275 INFO L225 Difference]: With dead ends: 128 [2019-12-07 10:28:58,275 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 10:28:58,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:28:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 10:28:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 109. [2019-12-07 10:28:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 10:28:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2019-12-07 10:28:58,278 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 67 [2019-12-07 10:28:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:58,279 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2019-12-07 10:28:58,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:28:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2019-12-07 10:28:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 10:28:58,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:58,280 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:58,280 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:28:58,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1654520225, now seen corresponding path program 1 times [2019-12-07 10:28:58,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:58,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776724389] [2019-12-07 10:28:58,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:28:59,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776724389] [2019-12-07 10:28:59,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444139748] [2019-12-07 10:28:59,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:28:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:59,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 113 conjunts are in the unsatisfiable core [2019-12-07 10:28:59,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:28:59,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:59,836 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:28:59,836 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:59,839 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:59,839 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:59,839 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 10:28:59,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:28:59,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:28:59,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:28:59,921 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:28:59,921 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 10:29:00,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:00,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2019-12-07 10:29:00,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:00,017 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:00,020 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:00,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:29:00,020 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-12-07 10:29:00,517 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.offset_31|]} [2019-12-07 10:29:00,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-12-07 10:29:00,520 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:00,527 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:00,539 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:00,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 120 [2019-12-07 10:29:00,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:00,541 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 10:29:00,569 INFO L614 ElimStorePlain]: treesize reduction 64, result has 61.9 percent of original size [2019-12-07 10:29:00,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:29:00,569 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:104 [2019-12-07 10:29:00,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:00,704 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:00,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 161 [2019-12-07 10:29:00,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:00,706 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:00,725 INFO L614 ElimStorePlain]: treesize reduction 76, result has 41.5 percent of original size [2019-12-07 10:29:00,726 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:00,726 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:83, output treesize:33 [2019-12-07 10:29:02,362 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int) (sll_circular_update_at_~data Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base|) .cse0 sll_circular_update_at_~data)) |c_#memory_int|)))) is different from true [2019-12-07 10:29:02,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:29:02,371 INFO L377 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 49 treesize of output 29 [2019-12-07 10:29:02,371 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:02,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:02,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:29:02,388 INFO L377 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 41 treesize of output 25 [2019-12-07 10:29:02,388 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:02,396 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:02,398 INFO L377 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 35 treesize of output 34 [2019-12-07 10:29:02,399 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:02,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:02,406 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:02,407 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:87, output treesize:33 [2019-12-07 10:29:03,028 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:03,028 INFO L377 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 68 treesize of output 60 [2019-12-07 10:29:03,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:29:03,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:29:03,030 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:29:03,043 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:03,050 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:03,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2019-12-07 10:29:03,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:29:03,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:29:03,052 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:29:03,074 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:03,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:03,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2019-12-07 10:29:03,083 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:03,111 INFO L614 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-12-07 10:29:03,113 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:03,113 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:71, output treesize:7 [2019-12-07 10:29:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2019-12-07 10:29:03,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:29:03,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 71 [2019-12-07 10:29:03,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660894918] [2019-12-07 10:29:03,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-12-07 10:29:03,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:29:03,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-12-07 10:29:03,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=4640, Unknown=1, NotChecked=136, Total=4970 [2019-12-07 10:29:03,186 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 71 states. [2019-12-07 10:29:13,787 WARN L192 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-12-07 10:29:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:19,373 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2019-12-07 10:29:19,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 10:29:19,374 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-12-07 10:29:19,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:19,374 INFO L225 Difference]: With dead ends: 132 [2019-12-07 10:29:19,374 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 10:29:19,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=541, Invalid=9752, Unknown=13, NotChecked=200, Total=10506 [2019-12-07 10:29:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 10:29:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 109. [2019-12-07 10:29:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 10:29:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-12-07 10:29:19,379 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 70 [2019-12-07 10:29:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:19,379 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-12-07 10:29:19,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-12-07 10:29:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-12-07 10:29:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 10:29:19,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:19,380 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:19,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:19,581 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:29:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:19,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1919199033, now seen corresponding path program 1 times [2019-12-07 10:29:19,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:29:19,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789800875] [2019-12-07 10:29:19,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:29:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 10:29:19,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789800875] [2019-12-07 10:29:19,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738756305] [2019-12-07 10:29:19,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:20,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 10:29:20,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:29:20,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:29:20,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:20,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:20,148 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:20,148 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 10:29:20,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:20,614 INFO L377 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 74 treesize of output 56 [2019-12-07 10:29:20,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:29:20,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:20,625 INFO L614 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-12-07 10:29:20,625 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:20,625 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:28 [2019-12-07 10:29:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 10:29:20,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:29:20,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17] total 40 [2019-12-07 10:29:20,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921476576] [2019-12-07 10:29:20,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 10:29:20,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:29:20,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 10:29:20,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 10:29:20,680 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 40 states. [2019-12-07 10:29:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:23,618 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-12-07 10:29:23,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 10:29:23,619 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 81 [2019-12-07 10:29:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:23,621 INFO L225 Difference]: With dead ends: 141 [2019-12-07 10:29:23,621 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 10:29:23,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=360, Invalid=3546, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 10:29:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 10:29:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2019-12-07 10:29:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 10:29:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2019-12-07 10:29:23,628 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 81 [2019-12-07 10:29:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:23,628 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2019-12-07 10:29:23,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 10:29:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2019-12-07 10:29:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 10:29:23,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:23,629 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:23,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:23,830 INFO L410 AbstractCegarLoop]: === Iteration 26 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:29:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1963594425, now seen corresponding path program 2 times [2019-12-07 10:29:23,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:29:23,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803982564] [2019-12-07 10:29:23,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:29:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 10:29:23,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803982564] [2019-12-07 10:29:23,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757468042] [2019-12-07 10:29:23,939 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:24,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:29:24,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:29:24,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:29:24,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:29:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 10:29:24,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:29:24,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-12-07 10:29:24,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677901525] [2019-12-07 10:29:24,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:29:24,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:29:24,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:29:24,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:29:24,050 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 12 states. [2019-12-07 10:29:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:24,378 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2019-12-07 10:29:24,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:29:24,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 84 [2019-12-07 10:29:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:24,379 INFO L225 Difference]: With dead ends: 130 [2019-12-07 10:29:24,379 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 10:29:24,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:29:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 10:29:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2019-12-07 10:29:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 10:29:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-12-07 10:29:24,381 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 84 [2019-12-07 10:29:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:24,382 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-12-07 10:29:24,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:29:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-12-07 10:29:24,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 10:29:24,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:24,382 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:24,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:24,583 INFO L410 AbstractCegarLoop]: === Iteration 27 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:29:24,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:24,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1680079121, now seen corresponding path program 1 times [2019-12-07 10:29:24,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:29:24,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000530489] [2019-12-07 10:29:24,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:29:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 10:29:24,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000530489] [2019-12-07 10:29:24,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:29:24,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:29:24,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240040235] [2019-12-07 10:29:24,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:29:24,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:29:24,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:29:24,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:29:24,777 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 15 states. [2019-12-07 10:29:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:25,255 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2019-12-07 10:29:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:29:25,256 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-12-07 10:29:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:25,257 INFO L225 Difference]: With dead ends: 120 [2019-12-07 10:29:25,257 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 10:29:25,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:29:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 10:29:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2019-12-07 10:29:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 10:29:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2019-12-07 10:29:25,259 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 86 [2019-12-07 10:29:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:25,259 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2019-12-07 10:29:25,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:29:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2019-12-07 10:29:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 10:29:25,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:25,260 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:25,260 INFO L410 AbstractCegarLoop]: === Iteration 28 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:29:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:25,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1680079122, now seen corresponding path program 1 times [2019-12-07 10:29:25,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:29:25,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038630651] [2019-12-07 10:29:25,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:29:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 10:29:25,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038630651] [2019-12-07 10:29:25,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:29:25,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:29:25,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124299072] [2019-12-07 10:29:25,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:29:25,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:29:25,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:29:25,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:29:25,338 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 10 states. [2019-12-07 10:29:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:25,640 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2019-12-07 10:29:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:29:25,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-07 10:29:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:25,641 INFO L225 Difference]: With dead ends: 121 [2019-12-07 10:29:25,641 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 10:29:25,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:29:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 10:29:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2019-12-07 10:29:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 10:29:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-12-07 10:29:25,645 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 86 [2019-12-07 10:29:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:25,645 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-12-07 10:29:25,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:29:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-12-07 10:29:25,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 10:29:25,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:25,646 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:25,646 INFO L410 AbstractCegarLoop]: === Iteration 29 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:29:25,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:25,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1983156394, now seen corresponding path program 1 times [2019-12-07 10:29:25,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:29:25,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884019107] [2019-12-07 10:29:25,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:29:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 10:29:25,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884019107] [2019-12-07 10:29:25,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147025591] [2019-12-07 10:29:25,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:25,851 INFO L264 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 10:29:25,853 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:29:25,866 INFO L377 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 19 treesize of output 1 [2019-12-07 10:29:25,866 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:25,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:25,867 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:25,867 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2019-12-07 10:29:25,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 10:29:25,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:25,890 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:25,890 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:25,890 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-12-07 10:29:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 10:29:25,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:29:25,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 15 [2019-12-07 10:29:25,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148297710] [2019-12-07 10:29:25,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:29:25,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:29:25,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:29:25,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:29:25,898 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 16 states. [2019-12-07 10:29:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:27,331 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2019-12-07 10:29:27,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:29:27,332 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-12-07 10:29:27,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:27,333 INFO L225 Difference]: With dead ends: 118 [2019-12-07 10:29:27,333 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 10:29:27,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2019-12-07 10:29:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 10:29:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2019-12-07 10:29:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 10:29:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-12-07 10:29:27,340 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 89 [2019-12-07 10:29:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:27,340 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-12-07 10:29:27,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:29:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-12-07 10:29:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 10:29:27,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:27,342 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:27,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:27,542 INFO L410 AbstractCegarLoop]: === Iteration 30 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:29:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:27,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1983156393, now seen corresponding path program 1 times [2019-12-07 10:29:27,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:29:27,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991385249] [2019-12-07 10:29:27,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:29:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:29:28,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991385249] [2019-12-07 10:29:28,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351081170] [2019-12-07 10:29:28,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:28,524 INFO L264 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 120 conjunts are in the unsatisfiable core [2019-12-07 10:29:28,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:29:28,675 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:28,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:29:28,676 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:28,680 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:28,680 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:28,680 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 10:29:28,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:29:28,684 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:28,689 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:28,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:29:28,691 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:28,696 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:28,696 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:28,696 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-12-07 10:29:28,736 INFO L377 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 27 treesize of output 22 [2019-12-07 10:29:28,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:28,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:28,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:28,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 53 [2019-12-07 10:29:28,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:28,756 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:28,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:28,763 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:29:28,763 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2019-12-07 10:29:30,260 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) |c_#memory_$Pointer$.offset|)) is different from true [2019-12-07 10:29:30,267 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:30,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 49 [2019-12-07 10:29:30,268 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:29:30,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:30,285 INFO L343 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2019-12-07 10:29:30,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2019-12-07 10:29:30,285 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:30,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:30,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:30,298 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:30,298 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:11 [2019-12-07 10:29:30,376 INFO L377 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 19 treesize of output 1 [2019-12-07 10:29:30,376 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:30,380 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:30,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:29:30,380 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-12-07 10:29:31,218 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.offset|))) is different from true [2019-12-07 10:29:31,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:29:31,222 INFO L377 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 27 treesize of output 11 [2019-12-07 10:29:31,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:31,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:31,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:31,227 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:11 [2019-12-07 10:29:31,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-12-07 10:29:31,766 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:31,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:31,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-12-07 10:29:31,771 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:31,774 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:31,774 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:31,774 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2019-12-07 10:29:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-12-07 10:29:31,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:29:31,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38] total 62 [2019-12-07 10:29:31,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544900111] [2019-12-07 10:29:31,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-12-07 10:29:31,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:29:31,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-12-07 10:29:31,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3452, Unknown=2, NotChecked=238, Total=3906 [2019-12-07 10:29:31,882 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 63 states. [2019-12-07 10:29:35,058 WARN L192 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-12-07 10:29:36,714 WARN L192 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2019-12-07 10:29:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:38,372 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2019-12-07 10:29:38,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 10:29:38,372 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 89 [2019-12-07 10:29:38,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:38,373 INFO L225 Difference]: With dead ends: 118 [2019-12-07 10:29:38,373 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 10:29:38,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1783 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=636, Invalid=7742, Unknown=2, NotChecked=362, Total=8742 [2019-12-07 10:29:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 10:29:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2019-12-07 10:29:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 10:29:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-12-07 10:29:38,376 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 89 [2019-12-07 10:29:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:38,376 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-12-07 10:29:38,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-12-07 10:29:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-12-07 10:29:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 10:29:38,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:38,377 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:38,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:38,577 INFO L410 AbstractCegarLoop]: === Iteration 31 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:29:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:38,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1950624042, now seen corresponding path program 1 times [2019-12-07 10:29:38,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:29:38,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863598030] [2019-12-07 10:29:38,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:29:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 10:29:38,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863598030] [2019-12-07 10:29:38,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:29:38,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 10:29:38,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905641842] [2019-12-07 10:29:38,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:29:38,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:29:38,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:29:38,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:29:38,737 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 16 states. [2019-12-07 10:29:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:39,094 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-12-07 10:29:39,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:29:39,095 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-12-07 10:29:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:39,095 INFO L225 Difference]: With dead ends: 113 [2019-12-07 10:29:39,095 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 10:29:39,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:29:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 10:29:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2019-12-07 10:29:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 10:29:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2019-12-07 10:29:39,098 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 89 [2019-12-07 10:29:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:39,098 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2019-12-07 10:29:39,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:29:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2019-12-07 10:29:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 10:29:39,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:39,099 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:39,099 INFO L410 AbstractCegarLoop]: === Iteration 32 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:29:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1348307467, now seen corresponding path program 1 times [2019-12-07 10:29:39,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:29:39,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525217252] [2019-12-07 10:29:39,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:29:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 10:29:39,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525217252] [2019-12-07 10:29:39,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:29:39,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:29:39,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406203750] [2019-12-07 10:29:39,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:29:39,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:29:39,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:29:39,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:29:39,235 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 15 states. [2019-12-07 10:29:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:39,632 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-12-07 10:29:39,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:29:39,632 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-12-07 10:29:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:39,633 INFO L225 Difference]: With dead ends: 109 [2019-12-07 10:29:39,633 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 10:29:39,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:29:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 10:29:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-12-07 10:29:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 10:29:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2019-12-07 10:29:39,635 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 90 [2019-12-07 10:29:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:39,635 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2019-12-07 10:29:39,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:29:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2019-12-07 10:29:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 10:29:39,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:39,636 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:39,636 INFO L410 AbstractCegarLoop]: === Iteration 33 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:29:39,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:39,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1358069626, now seen corresponding path program 1 times [2019-12-07 10:29:39,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:29:39,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169891348] [2019-12-07 10:29:39,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:29:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 10:29:40,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169891348] [2019-12-07 10:29:40,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540443272] [2019-12-07 10:29:40,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:40,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 85 conjunts are in the unsatisfiable core [2019-12-07 10:29:40,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:29:40,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 10:29:40,322 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:40,324 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:40,324 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:40,324 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-12-07 10:29:40,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:40,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:29:40,403 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:40,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:40,406 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:40,406 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 10:29:40,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:29:40,470 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:40,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:40,474 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:40,474 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 10:29:40,556 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:40,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-12-07 10:29:40,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:40,557 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:40,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:40,562 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:29:40,562 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 10:29:40,770 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:40,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-12-07 10:29:40,771 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:40,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:40,772 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:40,772 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2019-12-07 10:29:41,705 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))) |c_#memory_$Pointer$.base|)) is different from true [2019-12-07 10:29:41,732 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:41,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 117 [2019-12-07 10:29:41,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:41,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:41,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:41,734 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:29:41,754 INFO L614 ElimStorePlain]: treesize reduction 127, result has 21.6 percent of original size [2019-12-07 10:29:41,755 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:41,755 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:18 [2019-12-07 10:29:41,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-12-07 10:29:41,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:41,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:41,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:41,799 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-12-07 10:29:42,475 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-12-07 10:29:42,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:29:42,480 INFO L377 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 37 treesize of output 17 [2019-12-07 10:29:42,480 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:42,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:42,485 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:42,485 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:18 [2019-12-07 10:29:42,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 10:29:42,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:29:42,785 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:42,785 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:42,785 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-12-07 10:29:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-12-07 10:29:42,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:29:42,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 51 [2019-12-07 10:29:42,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399125170] [2019-12-07 10:29:42,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 10:29:42,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:29:42,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 10:29:42,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2298, Unknown=2, NotChecked=194, Total=2652 [2019-12-07 10:29:42,806 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 52 states. [2019-12-07 10:29:46,759 WARN L192 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 10:29:48,206 WARN L192 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-07 10:29:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:29:49,064 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2019-12-07 10:29:49,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 10:29:49,064 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 92 [2019-12-07 10:29:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:29:49,065 INFO L225 Difference]: With dead ends: 110 [2019-12-07 10:29:49,065 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 10:29:49,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=434, Invalid=4974, Unknown=2, NotChecked=290, Total=5700 [2019-12-07 10:29:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 10:29:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-12-07 10:29:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 10:29:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-12-07 10:29:49,067 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 92 [2019-12-07 10:29:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:29:49,068 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-12-07 10:29:49,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 10:29:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-12-07 10:29:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 10:29:49,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:29:49,068 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:29:49,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:49,269 INFO L410 AbstractCegarLoop]: === Iteration 34 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:29:49,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:29:49,270 INFO L82 PathProgramCache]: Analyzing trace with hash 394644074, now seen corresponding path program 1 times [2019-12-07 10:29:49,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:29:49,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761657642] [2019-12-07 10:29:49,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:29:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 10:29:49,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761657642] [2019-12-07 10:29:49,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125014506] [2019-12-07 10:29:49,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:29:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:29:49,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 93 conjunts are in the unsatisfiable core [2019-12-07 10:29:49,911 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:29:49,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:49,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:29:49,980 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:49,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:49,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:49,983 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-12-07 10:29:50,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:29:50,038 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:50,042 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:50,042 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:50,042 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 10:29:50,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:50,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2019-12-07 10:29:50,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:50,112 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:50,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:50,116 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:29:50,116 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-12-07 10:29:51,787 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))) |c_#memory_$Pointer$.base|)) is different from true [2019-12-07 10:29:51,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:51,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 179 [2019-12-07 10:29:51,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:29:51,842 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:51,859 INFO L614 ElimStorePlain]: treesize reduction 117, result has 19.9 percent of original size [2019-12-07 10:29:51,859 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:51,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:12 [2019-12-07 10:29:52,672 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-12-07 10:29:52,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:29:52,678 INFO L377 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 28 treesize of output 12 [2019-12-07 10:29:52,679 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:29:52,682 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:29:52,682 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:29:52,683 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:12 [2019-12-07 10:29:54,684 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_28 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_28 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_28) 0)))) is different from true [2019-12-07 10:29:56,725 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_29 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_29 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_29) 0)))) is different from true [2019-12-07 10:29:58,766 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_30 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_30) 0) v_main_~s~0.base_BEFORE_CALL_30))) is different from true [2019-12-07 10:30:10,810 WARN L192 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2019-12-07 10:30:12,855 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 10:30:14,905 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 10:30:16,957 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2019-12-07 10:30:19,019 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 10:30:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 9 not checked. [2019-12-07 10:30:19,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:30:19,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 56 [2019-12-07 10:30:19,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143632194] [2019-12-07 10:30:19,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-07 10:30:19,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:30:19,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-07 10:30:19,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2399, Unknown=10, NotChecked=510, Total=3080 [2019-12-07 10:30:19,042 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 56 states. [2019-12-07 10:30:21,987 WARN L192 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 10:30:23,431 WARN L192 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-07 10:30:35,544 WARN L192 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 10:30:53,799 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 10:30:55,879 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 10:30:57,942 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 10:31:02,034 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-07 10:31:06,144 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-12-07 10:31:10,283 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-12-07 10:31:12,382 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 10:31:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:31:12,521 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2019-12-07 10:31:12,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 10:31:12,522 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 95 [2019-12-07 10:31:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:31:12,522 INFO L225 Difference]: With dead ends: 110 [2019-12-07 10:31:12,522 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 10:31:12,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 81.7s TimeCoverageRelationStatistics Valid=424, Invalid=4694, Unknown=14, NotChecked=720, Total=5852 [2019-12-07 10:31:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 10:31:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-12-07 10:31:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 10:31:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2019-12-07 10:31:12,524 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 95 [2019-12-07 10:31:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:31:12,525 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2019-12-07 10:31:12,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-07 10:31:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2019-12-07 10:31:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 10:31:12,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:31:12,525 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:31:12,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:31:12,727 INFO L410 AbstractCegarLoop]: === Iteration 35 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:31:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:31:12,727 INFO L82 PathProgramCache]: Analyzing trace with hash -339555493, now seen corresponding path program 1 times [2019-12-07 10:31:12,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:31:12,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222113465] [2019-12-07 10:31:12,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:31:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:31:13,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222113465] [2019-12-07 10:31:13,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262416003] [2019-12-07 10:31:13,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:31:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:13,889 INFO L264 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 133 conjunts are in the unsatisfiable core [2019-12-07 10:31:13,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:31:14,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:14,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:31:14,054 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:14,059 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:14,060 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:31:14,060 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-12-07 10:31:14,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:31:14,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:14,070 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:14,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:31:14,071 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:14,078 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:14,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:31:14,078 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-12-07 10:31:14,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:31:14,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:31:14,128 INFO L377 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 26 treesize of output 21 [2019-12-07 10:31:14,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:14,150 INFO L614 ElimStorePlain]: treesize reduction 3, result has 95.7 percent of original size [2019-12-07 10:31:14,151 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:31:14,154 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:31:14,161 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:14,161 INFO L377 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 44 treesize of output 55 [2019-12-07 10:31:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:31:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:31:14,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:31:14,162 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:14,186 INFO L614 ElimStorePlain]: treesize reduction 38, result has 53.1 percent of original size [2019-12-07 10:31:14,186 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:31:14,186 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:49 [2019-12-07 10:31:15,874 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|)) (.cse1 (+ sll_circular_update_at_~head.offset 4))) (and (<= (select (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|)))) is different from true [2019-12-07 10:31:15,888 INFO L343 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2019-12-07 10:31:15,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 48 [2019-12-07 10:31:15,889 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:15,912 INFO L614 ElimStorePlain]: treesize reduction 6, result has 92.6 percent of original size [2019-12-07 10:31:15,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:31:15,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:15,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 55 [2019-12-07 10:31:15,918 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:15,925 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:15,925 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:31:15,926 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:118, output treesize:41 [2019-12-07 10:31:17,261 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-12-07 10:31:17,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:31:17,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:17,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 48 [2019-12-07 10:31:17,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:17,293 INFO L614 ElimStorePlain]: treesize reduction 28, result has 71.7 percent of original size [2019-12-07 10:31:17,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:31:17,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-12-07 10:31:17,296 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:17,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:17,304 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:31:17,305 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:41 [2019-12-07 10:31:17,718 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:17,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 64 [2019-12-07 10:31:17,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:31:17,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:31:17,719 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:31:17,741 INFO L614 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size [2019-12-07 10:31:17,745 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:17,745 INFO L377 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-12-07 10:31:17,745 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:17,754 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:17,755 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:31:17,755 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:23 [2019-12-07 10:31:17,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:31:17,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:31:17,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:31:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 2 not checked. [2019-12-07 10:31:17,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:31:17,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 53 [2019-12-07 10:31:17,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112538187] [2019-12-07 10:31:17,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-12-07 10:31:17,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:31:17,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-12-07 10:31:17,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2394, Unknown=2, NotChecked=198, Total=2756 [2019-12-07 10:31:17,971 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 53 states. [2019-12-07 10:31:22,789 WARN L192 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2019-12-07 10:31:26,259 WARN L192 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2019-12-07 10:31:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:31:27,480 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-12-07 10:31:27,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 10:31:27,480 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 95 [2019-12-07 10:31:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:31:27,481 INFO L225 Difference]: With dead ends: 96 [2019-12-07 10:31:27,481 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 10:31:27,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 77 SyntacticMatches, 12 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=448, Invalid=4670, Unknown=2, NotChecked=282, Total=5402 [2019-12-07 10:31:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 10:31:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-12-07 10:31:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 10:31:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-12-07 10:31:27,483 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 95 [2019-12-07 10:31:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:31:27,483 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-12-07 10:31:27,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-12-07 10:31:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-12-07 10:31:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 10:31:27,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:31:27,484 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:31:27,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:31:27,685 INFO L410 AbstractCegarLoop]: === Iteration 36 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:31:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:31:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash 104642571, now seen corresponding path program 1 times [2019-12-07 10:31:27,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:31:27,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754014451] [2019-12-07 10:31:27,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:31:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:31:28,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754014451] [2019-12-07 10:31:28,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733073479] [2019-12-07 10:31:28,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:31:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:28,438 INFO L264 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 10:31:28,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:31:28,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:31:28,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:31:28,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 10:31:28,591 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:28,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:28,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 10:31:28,602 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:28,624 INFO L614 ElimStorePlain]: treesize reduction 23, result has 54.0 percent of original size [2019-12-07 10:31:28,624 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 10:31:28,624 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:24 [2019-12-07 10:31:28,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:31:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 10:31:28,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:31:28,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7] total 39 [2019-12-07 10:31:28,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168036724] [2019-12-07 10:31:28,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 10:31:28,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:31:28,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 10:31:28,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 10:31:28,709 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 40 states. [2019-12-07 10:31:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:31:30,580 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-12-07 10:31:30,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 10:31:30,580 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 97 [2019-12-07 10:31:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:31:30,581 INFO L225 Difference]: With dead ends: 95 [2019-12-07 10:31:30,581 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 10:31:30,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=316, Invalid=3224, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 10:31:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 10:31:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-12-07 10:31:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 10:31:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2019-12-07 10:31:30,583 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 97 [2019-12-07 10:31:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:31:30,584 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2019-12-07 10:31:30,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 10:31:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2019-12-07 10:31:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 10:31:30,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:31:30,585 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:31:30,785 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:31:30,786 INFO L410 AbstractCegarLoop]: === Iteration 37 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:31:30,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:31:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1442361681, now seen corresponding path program 1 times [2019-12-07 10:31:30,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:31:30,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976938925] [2019-12-07 10:31:30,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:31:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 10:31:31,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976938925] [2019-12-07 10:31:31,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366679814] [2019-12-07 10:31:31,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:31:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:31,861 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 107 conjunts are in the unsatisfiable core [2019-12-07 10:31:31,864 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:31:32,011 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:32,011 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 63 [2019-12-07 10:31:32,012 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:32,035 INFO L614 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-12-07 10:31:32,036 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:31:32,036 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2019-12-07 10:31:32,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:31:32,138 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:32,150 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:32,150 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:31:32,150 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-12-07 10:31:32,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:32,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 56 [2019-12-07 10:31:32,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:31:32,336 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:32,346 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:32,347 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:31:32,347 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2019-12-07 10:31:32,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:31:32,622 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:32,630 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:32,635 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:32,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-12-07 10:31:32,635 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:31:32,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:32,642 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:31:32,642 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:18 [2019-12-07 10:31:44,636 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 10:31:44,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:44,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2019-12-07 10:31:44,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:31:44,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:44,704 INFO L614 ElimStorePlain]: treesize reduction 60, result has 55.2 percent of original size [2019-12-07 10:31:44,705 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:31:44,705 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:99, output treesize:57 [2019-12-07 10:31:44,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:31:44,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:44,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:44,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-12-07 10:31:44,798 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:31:44,805 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:44,806 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:31:44,806 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2019-12-07 10:31:54,099 WARN L192 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 10:31:54,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:31:54,127 INFO L377 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 46 treesize of output 22 [2019-12-07 10:31:54,128 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:54,142 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:54,142 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:31:54,142 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:57 [2019-12-07 10:31:54,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:31:54,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:54,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:54,227 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:31:54,227 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-12-07 10:31:54,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:31:54,404 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:54,411 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:54,412 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:31:54,412 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-12-07 10:31:54,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:31:54,489 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:54,496 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:54,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:31:54,498 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:31:54,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:31:54,503 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:31:54,503 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2019-12-07 10:32:02,565 WARN L192 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 16 [2019-12-07 10:32:04,634 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2019-12-07 10:32:06,706 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 10:32:08,782 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 10:32:10,860 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2019-12-07 10:32:14,956 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 10:32:17,063 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-12-07 10:32:17,069 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:32:17,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2019-12-07 10:32:17,070 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:32:17,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:32:17,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:32:17,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:32:17,092 INFO L377 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 35 treesize of output 27 [2019-12-07 10:32:17,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:32:17,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:32:17,093 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:32:17,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:32:17,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:32:17,111 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 10:32:17,111 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:76, output treesize:51 [2019-12-07 10:32:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 10:32:17,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:32:17,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 62 [2019-12-07 10:32:17,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839840677] [2019-12-07 10:32:17,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-12-07 10:32:17,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:32:17,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-12-07 10:32:17,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3676, Unknown=22, NotChecked=0, Total=3906 [2019-12-07 10:32:17,264 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 63 states. [2019-12-07 10:32:41,091 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 10:32:48,146 WARN L192 SmtUtils]: Spent 792.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 10:32:55,273 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-07 10:32:59,414 WARN L192 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-07 10:32:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:32:59,649 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-12-07 10:32:59,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 10:32:59,650 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 101 [2019-12-07 10:32:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:32:59,650 INFO L225 Difference]: With dead ends: 94 [2019-12-07 10:32:59,650 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:32:59,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 81 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 64.0s TimeCoverageRelationStatistics Valid=514, Invalid=7293, Unknown=25, NotChecked=0, Total=7832 [2019-12-07 10:32:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:32:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:32:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:32:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:32:59,651 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2019-12-07 10:32:59,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:32:59,651 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:32:59,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-12-07 10:32:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:32:59,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:32:59,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:32:59,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:32:59 BoogieIcfgContainer [2019-12-07 10:32:59,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:32:59,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:32:59,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:32:59,858 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:32:59,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:26:11" (3/4) ... [2019-12-07 10:32:59,860 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:32:59,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 10:32:59,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-12-07 10:32:59,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_get_data_at [2019-12-07 10:32:59,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 10:32:59,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 10:32:59,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2019-12-07 10:32:59,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_destroy [2019-12-07 10:32:59,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 10:32:59,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_update_at [2019-12-07 10:32:59,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-12-07 10:32:59,869 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-12-07 10:32:59,870 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 10:32:59,870 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 10:32:59,870 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 10:32:59,902 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_961f5dd0-93cd-409b-a9e3-07b925129041/bin/uautomizer/witness.graphml [2019-12-07 10:32:59,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:32:59,903 INFO L168 Benchmark]: Toolchain (without parser) took 409645.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.8 MB in the beginning and 949.2 MB in the end (delta: -9.5 MB). Peak memory consumption was 128.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:32:59,903 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:32:59,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:32:59,903 INFO L168 Benchmark]: Boogie Preprocessor took 40.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:32:59,903 INFO L168 Benchmark]: RCFGBuilder took 375.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:32:59,904 INFO L168 Benchmark]: TraceAbstraction took 408843.57 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 32.0 MB). Free memory was 1.0 GB in the beginning and 958.1 MB in the end (delta: 60.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:32:59,904 INFO L168 Benchmark]: Witness Printer took 44.17 ms. Allocated memory is still 1.2 GB. Free memory was 958.1 MB in the beginning and 949.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:32:59,905 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 375.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 408843.57 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 32.0 MB). Free memory was 1.0 GB in the beginning and 958.1 MB in the end (delta: 60.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. * Witness Printer took 44.17 ms. Allocated memory is still 1.2 GB. Free memory was 958.1 MB in the beginning and 949.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 609]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 111 locations, 28 error locations. Result: SAFE, OverallTime: 408.7s, OverallIterations: 37, TraceHistogramMax: 3, AutomataDifference: 226.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2281 SDtfs, 6811 SDslu, 12327 SDs, 0 SdLazy, 43416 SolverSat, 1644 SolverUnsat, 49 SolverUnknown, 0 SolverNotchecked, 91.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2672 GetRequests, 1370 SyntacticMatches, 42 SemanticMatches, 1260 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 12018 ImplicationChecksByTransitivity, 301.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 660 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 175.4s InterpolantComputationTime, 3539 NumberOfCodeBlocks, 3529 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 3483 ConstructedInterpolants, 280 QuantifiedInterpolants, 2747468 SizeOfPredicates, 305 NumberOfNonLiveVariables, 6407 ConjunctsInSsa, 1112 ConjunctsInUnsatCore, 56 InterpolantComputations, 19 PerfectInterpolantSequences, 833/1214 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...