./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/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 3aee1e8d9b723b18f218b6c1185554e637930c5d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:38:49,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:38:49,447 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:38:49,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:38:49,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:38:49,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:38:49,457 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:38:49,458 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:38:49,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:38:49,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:38:49,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:38:49,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:38:49,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:38:49,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:38:49,462 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:38:49,463 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:38:49,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:38:49,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:38:49,466 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:38:49,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:38:49,467 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:38:49,468 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:38:49,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:38:49,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:38:49,470 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:38:49,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:38:49,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:38:49,472 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:38:49,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:38:49,473 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:38:49,473 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:38:49,474 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:38:49,474 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:38:49,474 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:38:49,475 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:38:49,475 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:38:49,475 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 06:38:49,485 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:38:49,485 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:38:49,486 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:38:49,486 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:38:49,486 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:38:49,486 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:38:49,487 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:38:49,487 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:38:49,487 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:38:49,487 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:38:49,487 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:38:49,487 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:38:49,487 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:38:49,488 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 06:38:49,488 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 06:38:49,488 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 06:38:49,488 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:38:49,488 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:38:49,488 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:38:49,489 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:38:49,489 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:38:49,489 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:38:49,489 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:38:49,489 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:38:49,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:38:49,489 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:38:49,490 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:38:49,490 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:38:49,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/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 -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2018-11-23 06:38:49,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:38:49,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:38:49,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:38:49,525 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:38:49,525 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:38:49,525 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-23 06:38:49,560 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/data/2db5f87a8/8cf4a2b5b2c3414b8bf90424ad9552cc/FLAG0957f1991 [2018-11-23 06:38:49,987 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:38:49,987 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-23 06:38:49,993 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/data/2db5f87a8/8cf4a2b5b2c3414b8bf90424ad9552cc/FLAG0957f1991 [2018-11-23 06:38:50,002 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/data/2db5f87a8/8cf4a2b5b2c3414b8bf90424ad9552cc [2018-11-23 06:38:50,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:38:50,005 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 06:38:50,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:38:50,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:38:50,008 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:38:50,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:38:50" (1/1) ... [2018-11-23 06:38:50,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28603259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:50, skipping insertion in model container [2018-11-23 06:38:50,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:38:50" (1/1) ... [2018-11-23 06:38:50,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:38:50,043 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:38:50,228 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:38:50,234 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:38:50,304 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:38:50,327 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:38:50,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:50 WrapperNode [2018-11-23 06:38:50,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:38:50,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:38:50,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:38:50,328 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:38:50,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:50" (1/1) ... [2018-11-23 06:38:50,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:50" (1/1) ... [2018-11-23 06:38:50,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:50" (1/1) ... [2018-11-23 06:38:50,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:50" (1/1) ... [2018-11-23 06:38:50,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:50" (1/1) ... [2018-11-23 06:38:50,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:50" (1/1) ... [2018-11-23 06:38:50,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:50" (1/1) ... [2018-11-23 06:38:50,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:38:50,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:38:50,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:38:50,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:38:50,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/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 [2018-11-23 06:38:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:38:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:38:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:38:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-23 06:38:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-23 06:38:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-23 06:38:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-23 06:38:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-23 06:38:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-23 06:38:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-23 06:38:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-23 06:38:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-23 06:38:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-23 06:38:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-23 06:38:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-23 06:38:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-23 06:38:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-23 06:38:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-23 06:38:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-23 06:38:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-23 06:38:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-23 06:38:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-23 06:38:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-23 06:38:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-23 06:38:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-23 06:38:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-23 06:38:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-23 06:38:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-23 06:38:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-23 06:38:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-23 06:38:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-23 06:38:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-23 06:38:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-23 06:38:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-23 06:38:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-23 06:38:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-23 06:38:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-23 06:38:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-23 06:38:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-23 06:38:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-23 06:38:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-23 06:38:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-23 06:38:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-23 06:38:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-23 06:38:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-23 06:38:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-23 06:38:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-23 06:38:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-23 06:38:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-23 06:38:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-23 06:38:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-23 06:38:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-23 06:38:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-23 06:38:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-23 06:38:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-23 06:38:50,412 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-23 06:38:50,412 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-23 06:38:50,412 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-23 06:38:50,412 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-23 06:38:50,412 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-23 06:38:50,412 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-23 06:38:50,412 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-23 06:38:50,412 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-23 06:38:50,412 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-23 06:38:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-23 06:38:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-23 06:38:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 06:38:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-23 06:38:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-23 06:38:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-23 06:38:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-23 06:38:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-23 06:38:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-23 06:38:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-23 06:38:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-23 06:38:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-23 06:38:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-23 06:38:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-23 06:38:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-23 06:38:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-23 06:38:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-23 06:38:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-23 06:38:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-23 06:38:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-23 06:38:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-23 06:38:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-23 06:38:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-23 06:38:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-23 06:38:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-23 06:38:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-23 06:38:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-23 06:38:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-23 06:38:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-23 06:38:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-23 06:38:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-23 06:38:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-23 06:38:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-23 06:38:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-23 06:38:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-23 06:38:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-23 06:38:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-23 06:38:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-23 06:38:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-23 06:38:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-23 06:38:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-23 06:38:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-23 06:38:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-23 06:38:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-23 06:38:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:38:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:38:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 06:38:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:38:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 06:38:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:38:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:38:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:38:50,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:38:50,855 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:38:50,855 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 06:38:50,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:50 BoogieIcfgContainer [2018-11-23 06:38:50,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:38:50,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:38:50,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:38:50,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:38:50,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:38:50" (1/3) ... [2018-11-23 06:38:50,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d81a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:38:50, skipping insertion in model container [2018-11-23 06:38:50,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:50" (2/3) ... [2018-11-23 06:38:50,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d81a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:38:50, skipping insertion in model container [2018-11-23 06:38:50,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:50" (3/3) ... [2018-11-23 06:38:50,860 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-23 06:38:50,868 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:38:50,874 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-11-23 06:38:50,887 INFO L257 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2018-11-23 06:38:50,908 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:38:50,909 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:38:50,909 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 06:38:50,909 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:38:50,909 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:38:50,909 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:38:50,909 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:38:50,909 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:38:50,909 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:38:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states. [2018-11-23 06:38:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 06:38:50,928 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:50,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:50,930 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:50,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1280679066, now seen corresponding path program 1 times [2018-11-23 06:38:50,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:50,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:50,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:50,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:50,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:51,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:51,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:38:51,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:38:51,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:38:51,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:38:51,044 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 3 states. [2018-11-23 06:38:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:51,180 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-23 06:38:51,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:38:51,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 06:38:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:51,187 INFO L225 Difference]: With dead ends: 113 [2018-11-23 06:38:51,187 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 06:38:51,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:38:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 06:38:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-11-23 06:38:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 06:38:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-11-23 06:38:51,211 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 7 [2018-11-23 06:38:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:51,212 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-11-23 06:38:51,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:38:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-11-23 06:38:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 06:38:51,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:51,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:51,213 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:51,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:51,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1280679065, now seen corresponding path program 1 times [2018-11-23 06:38:51,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:51,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:51,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:51,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:51,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:51,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:51,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:38:51,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:38:51,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:38:51,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:38:51,247 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 3 states. [2018-11-23 06:38:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:51,347 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-11-23 06:38:51,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:38:51,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 06:38:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:51,348 INFO L225 Difference]: With dead ends: 119 [2018-11-23 06:38:51,348 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 06:38:51,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:38:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 06:38:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-11-23 06:38:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 06:38:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-11-23 06:38:51,355 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 7 [2018-11-23 06:38:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:51,355 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-11-23 06:38:51,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:38:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-11-23 06:38:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 06:38:51,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:51,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:51,356 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:51,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:51,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1559376120, now seen corresponding path program 1 times [2018-11-23 06:38:51,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:51,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:51,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:51,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:51,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:51,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:51,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:38:51,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:38:51,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:38:51,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:38:51,428 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 4 states. [2018-11-23 06:38:51,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:51,574 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-11-23 06:38:51,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:38:51,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 06:38:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:51,575 INFO L225 Difference]: With dead ends: 117 [2018-11-23 06:38:51,576 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 06:38:51,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:38:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 06:38:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-11-23 06:38:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 06:38:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-11-23 06:38:51,582 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 12 [2018-11-23 06:38:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:51,582 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-11-23 06:38:51,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:38:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-23 06:38:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 06:38:51,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:51,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:51,583 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:51,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:51,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1559376119, now seen corresponding path program 1 times [2018-11-23 06:38:51,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:51,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:51,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:51,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:51,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:51,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:38:51,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:38:51,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:38:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:38:51,657 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 4 states. [2018-11-23 06:38:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:51,785 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-11-23 06:38:51,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:38:51,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 06:38:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:51,786 INFO L225 Difference]: With dead ends: 134 [2018-11-23 06:38:51,787 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 06:38:51,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:38:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 06:38:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2018-11-23 06:38:51,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 06:38:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2018-11-23 06:38:51,794 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 12 [2018-11-23 06:38:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:51,794 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-11-23 06:38:51,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:38:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2018-11-23 06:38:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 06:38:51,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:51,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:51,796 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:51,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1007724238, now seen corresponding path program 1 times [2018-11-23 06:38:51,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:51,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:51,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:51,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:51,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:51,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:51,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:38:51,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:38:51,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:38:51,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:38:51,858 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 6 states. [2018-11-23 06:38:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:52,106 INFO L93 Difference]: Finished difference Result 181 states and 198 transitions. [2018-11-23 06:38:52,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:38:52,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 06:38:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:52,107 INFO L225 Difference]: With dead ends: 181 [2018-11-23 06:38:52,107 INFO L226 Difference]: Without dead ends: 181 [2018-11-23 06:38:52,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:38:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-23 06:38:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 110. [2018-11-23 06:38:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 06:38:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-11-23 06:38:52,115 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 15 [2018-11-23 06:38:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:52,115 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-11-23 06:38:52,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:38:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-11-23 06:38:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 06:38:52,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:52,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:52,117 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:52,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:52,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1007724237, now seen corresponding path program 1 times [2018-11-23 06:38:52,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:52,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:52,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:52,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:52,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:52,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:38:52,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:38:52,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:38:52,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:38:52,192 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 6 states. [2018-11-23 06:38:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:52,444 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2018-11-23 06:38:52,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:38:52,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 06:38:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:52,445 INFO L225 Difference]: With dead ends: 182 [2018-11-23 06:38:52,445 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 06:38:52,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-23 06:38:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 06:38:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 105. [2018-11-23 06:38:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 06:38:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2018-11-23 06:38:52,451 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 15 [2018-11-23 06:38:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:52,451 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2018-11-23 06:38:52,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:38:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2018-11-23 06:38:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 06:38:52,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:52,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:52,452 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:52,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash 305175762, now seen corresponding path program 1 times [2018-11-23 06:38:52,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:52,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:52,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:52,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:52,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:52,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:52,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:38:52,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:38:52,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:38:52,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:38:52,493 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 4 states. [2018-11-23 06:38:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:52,591 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2018-11-23 06:38:52,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:38:52,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 06:38:52,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:52,592 INFO L225 Difference]: With dead ends: 119 [2018-11-23 06:38:52,593 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 06:38:52,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:38:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 06:38:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-11-23 06:38:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 06:38:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-11-23 06:38:52,598 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 21 [2018-11-23 06:38:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:52,599 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-11-23 06:38:52,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:38:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-11-23 06:38:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 06:38:52,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:52,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:52,600 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:52,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1227495682, now seen corresponding path program 1 times [2018-11-23 06:38:52,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:52,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:52,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:52,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:52,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:52,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:52,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:38:52,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:38:52,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:38:52,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:38:52,705 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 5 states. [2018-11-23 06:38:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:52,803 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-11-23 06:38:52,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:38:52,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 06:38:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:52,804 INFO L225 Difference]: With dead ends: 111 [2018-11-23 06:38:52,805 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 06:38:52,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:38:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 06:38:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2018-11-23 06:38:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 06:38:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-11-23 06:38:52,809 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2018-11-23 06:38:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:52,810 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-11-23 06:38:52,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:38:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-11-23 06:38:52,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 06:38:52,811 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:52,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:52,811 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:52,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash -601833439, now seen corresponding path program 1 times [2018-11-23 06:38:52,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:52,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:52,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:52,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:52,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:52,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:52,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:38:52,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:38:52,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:38:52,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:38:52,864 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 6 states. [2018-11-23 06:38:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:53,096 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2018-11-23 06:38:53,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:38:53,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 06:38:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:53,097 INFO L225 Difference]: With dead ends: 165 [2018-11-23 06:38:53,097 INFO L226 Difference]: Without dead ends: 165 [2018-11-23 06:38:53,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:38:53,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-23 06:38:53,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 103. [2018-11-23 06:38:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 06:38:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-11-23 06:38:53,101 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 23 [2018-11-23 06:38:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:53,102 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-11-23 06:38:53,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:38:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-11-23 06:38:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 06:38:53,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:53,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:53,103 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:53,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:53,103 INFO L82 PathProgramCache]: Analyzing trace with hash -601833438, now seen corresponding path program 1 times [2018-11-23 06:38:53,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:53,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:53,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:53,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:53,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:53,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:53,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:38:53,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:38:53,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:38:53,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:38:53,171 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 6 states. [2018-11-23 06:38:53,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:53,381 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2018-11-23 06:38:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:38:53,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 06:38:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:53,386 INFO L225 Difference]: With dead ends: 182 [2018-11-23 06:38:53,386 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 06:38:53,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:38:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 06:38:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 95. [2018-11-23 06:38:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 06:38:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2018-11-23 06:38:53,389 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 23 [2018-11-23 06:38:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:53,389 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-11-23 06:38:53,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:38:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2018-11-23 06:38:53,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 06:38:53,390 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:53,390 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:53,390 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:53,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash -513964692, now seen corresponding path program 1 times [2018-11-23 06:38:53,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:53,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:53,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:53,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:53,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:38:53,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:38:53,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:38:53,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:38:53,471 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 5 states. [2018-11-23 06:38:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:53,560 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-11-23 06:38:53,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:38:53,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 06:38:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:53,562 INFO L225 Difference]: With dead ends: 109 [2018-11-23 06:38:53,562 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 06:38:53,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:38:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 06:38:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-11-23 06:38:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 06:38:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-11-23 06:38:53,564 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 27 [2018-11-23 06:38:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:53,564 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-11-23 06:38:53,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:38:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-11-23 06:38:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 06:38:53,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:53,568 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 06:38:53,568 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:53,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash 435598066, now seen corresponding path program 1 times [2018-11-23 06:38:53,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:53,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:53,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:53,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:53,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:53,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:38:53,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:38:53,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:53,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:38:53,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:53,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:53,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 06:38:53,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:53,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:53,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-11-23 06:38:53,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:38:53,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:38:53,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:53,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:53,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:53,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-11-23 06:38:53,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:53,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-23 06:38:53,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:38:53,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:53,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:53,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:53,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-23 06:38:54,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-11-23 06:38:54,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:54,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 06:38:54,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:54,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:54,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:38:54,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-11-23 06:38:54,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-11-23 06:38:54,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 06:38:54,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:54,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:38:54,112 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:54,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:54,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:38:54,118 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-11-23 06:38:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:54,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:38:54,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-23 06:38:54,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 06:38:54,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 06:38:54,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-11-23 06:38:54,180 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 22 states. [2018-11-23 06:38:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:54,778 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2018-11-23 06:38:54,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 06:38:54,778 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-11-23 06:38:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:54,779 INFO L225 Difference]: With dead ends: 179 [2018-11-23 06:38:54,779 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 06:38:54,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2018-11-23 06:38:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 06:38:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 122. [2018-11-23 06:38:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 06:38:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-11-23 06:38:54,783 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 36 [2018-11-23 06:38:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:54,783 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-11-23 06:38:54,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 06:38:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-11-23 06:38:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 06:38:54,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:54,784 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 06:38:54,784 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:54,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash 435598067, now seen corresponding path program 1 times [2018-11-23 06:38:54,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:54,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:54,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:54,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:54,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:54,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:38:54,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:38:54,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:54,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:38:54,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:38:54,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:55,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:55,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:38:55,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-23 06:38:55,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:38:55,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:38:55,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:38:55,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:38:55,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,046 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-23 06:38:55,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:55,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-23 06:38:55,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:38:55,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:55,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 06:38:55,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 06:38:55,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-11-23 06:38:55,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2018-11-23 06:38:55,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:55,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 06:38:55,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-11-23 06:38:55,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:55,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 06:38:55,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:38:55,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2018-11-23 06:38:55,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-11-23 06:38:55,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-23 06:38:55,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:38:55,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 06:38:55,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:38:55,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:38:55,308 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,309 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:55,313 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-11-23 06:38:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:55,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:38:55,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2018-11-23 06:38:55,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 06:38:55,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 06:38:55,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-23 06:38:55,340 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 17 states. [2018-11-23 06:38:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:55,946 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2018-11-23 06:38:55,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 06:38:55,946 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-23 06:38:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:55,947 INFO L225 Difference]: With dead ends: 184 [2018-11-23 06:38:55,947 INFO L226 Difference]: Without dead ends: 184 [2018-11-23 06:38:55,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2018-11-23 06:38:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-23 06:38:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 124. [2018-11-23 06:38:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 06:38:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-11-23 06:38:55,951 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 36 [2018-11-23 06:38:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:55,951 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-11-23 06:38:55,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 06:38:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-11-23 06:38:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 06:38:55,952 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:55,952 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 06:38:55,952 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:55,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash 147100084, now seen corresponding path program 1 times [2018-11-23 06:38:55,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:55,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:55,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:55,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:55,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:56,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:38:56,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:38:56,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:56,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:38:56,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:38:56,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:56,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:56,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:38:56,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-23 06:38:56,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:38:56,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:38:56,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:38:56,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:38:56,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-23 06:38:56,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:56,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-23 06:38:56,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:38:56,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:56,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 06:38:56,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 06:38:56,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-11-23 06:38:56,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-11-23 06:38:56,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 104 [2018-11-23 06:38:56,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:56,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 06:38:56,631 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,642 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-11-23 06:38:56,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 06:38:56,659 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,660 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-11-23 06:38:56,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:56,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 06:38:56,677 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,681 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:38:56,688 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2018-11-23 06:38:56,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-11-23 06:38:56,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-11-23 06:38:56,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:38:56,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 06:38:56,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:38:56,781 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:38:56,786 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:56,791 INFO L267 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. [2018-11-23 06:38:56,792 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-11-23 06:38:56,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 06:38:56,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 06:38:56,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 06:38:56,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:38:56,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:38:56,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-11-23 06:38:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:56,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:38:56,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-11-23 06:38:56,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 06:38:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 06:38:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2018-11-23 06:38:56,912 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 32 states. [2018-11-23 06:38:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:58,605 INFO L93 Difference]: Finished difference Result 182 states and 195 transitions. [2018-11-23 06:38:58,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 06:38:58,605 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-11-23 06:38:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:58,606 INFO L225 Difference]: With dead ends: 182 [2018-11-23 06:38:58,606 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 06:38:58,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=408, Invalid=2347, Unknown=1, NotChecked=0, Total=2756 [2018-11-23 06:38:58,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 06:38:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 121. [2018-11-23 06:38:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 06:38:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-11-23 06:38:58,609 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 40 [2018-11-23 06:38:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:58,610 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-11-23 06:38:58,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 06:38:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-11-23 06:38:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 06:38:58,610 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:58,610 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 06:38:58,611 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:38:58,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash 935958873, now seen corresponding path program 1 times [2018-11-23 06:38:58,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:38:58,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:38:58,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:58,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:58,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:58,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:38:58,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:38:58,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:58,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:38:58,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:58,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:58,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:38:58,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-23 06:38:58,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:38:58,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:38:58,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-23 06:38:58,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 06:38:58,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:38:58,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:24 [2018-11-23 06:38:58,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 06:38:58,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:58,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 06:38:58,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2018-11-23 06:38:58,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:58,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:58,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:38:58,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-11-23 06:38:58,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 06:38:58,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 06:38:58,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:58,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-11-23 06:38:59,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:59,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 65 [2018-11-23 06:38:59,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2018-11-23 06:38:59,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 06:38:59,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-11-23 06:38:59,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:38:59,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 06:38:59,106 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:81 [2018-11-23 06:38:59,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 76 [2018-11-23 06:38:59,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:59,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67 [2018-11-23 06:38:59,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:59,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 70 [2018-11-23 06:38:59,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 06:38:59,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:38:59,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-11-23 06:38:59,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:38:59,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 06:38:59,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 06:38:59,247 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:149, output treesize:106 [2018-11-23 06:38:59,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-11-23 06:38:59,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 06:38:59,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:38:59,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2018-11-23 06:38:59,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-23 06:38:59,357 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 06:38:59,368 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 06:38:59,378 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 06:38:59,389 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 06:38:59,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 06:38:59,400 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,404 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:38:59,409 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:89, output treesize:5 [2018-11-23 06:38:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:59,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:38:59,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 23 [2018-11-23 06:38:59,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 06:38:59,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 06:38:59,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=479, Unknown=1, NotChecked=0, Total=552 [2018-11-23 06:38:59,437 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 24 states. [2018-11-23 06:39:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:00,276 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2018-11-23 06:39:00,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 06:39:00,277 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-11-23 06:39:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:00,277 INFO L225 Difference]: With dead ends: 206 [2018-11-23 06:39:00,278 INFO L226 Difference]: Without dead ends: 206 [2018-11-23 06:39:00,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=282, Invalid=1521, Unknown=3, NotChecked=0, Total=1806 [2018-11-23 06:39:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-23 06:39:00,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 146. [2018-11-23 06:39:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 06:39:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-11-23 06:39:00,281 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 42 [2018-11-23 06:39:00,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:00,282 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-11-23 06:39:00,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 06:39:00,282 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-11-23 06:39:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 06:39:00,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:00,283 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 06:39:00,283 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:39:00,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:00,283 INFO L82 PathProgramCache]: Analyzing trace with hash 935958874, now seen corresponding path program 1 times [2018-11-23 06:39:00,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:00,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:00,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:00,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:00,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:00,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:39:00,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:39:00,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:00,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:00,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 06:39:00,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-23 06:39:00,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:39:00,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:00,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:39:00,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:00,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-23 06:39:00,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-23 06:39:00,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:00,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 06:39:00,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 06:39:00,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-11-23 06:39:00,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-11-23 06:39:00,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 06:39:00,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2018-11-23 06:39:00,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-11-23 06:39:00,754 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2018-11-23 06:39:00,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-11-23 06:39:00,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 06:39:00,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-11-23 06:39:00,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:00,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-11-23 06:39:00,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 06:39:00,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-11-23 06:39:00,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 06:39:00,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:00,928 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:66 [2018-11-23 06:39:01,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:01,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:01,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 83 [2018-11-23 06:39:01,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:01,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-23 06:39:01,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 06:39:01,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:01,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-11-23 06:39:01,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 130 [2018-11-23 06:39:01,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:01,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-11-23 06:39:01,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-11-23 06:39:01,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:01,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-11-23 06:39:01,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:01,172 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:101 [2018-11-23 06:39:01,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61 [2018-11-23 06:39:01,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-23 06:39:01,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 06:39:01,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:01,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:39:01,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:01,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 06:39:01,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:39:01,313 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:39:01,320 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,323 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:01,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:01,333 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-11-23 06:39:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:01,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:39:01,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-11-23 06:39:01,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 06:39:01,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 06:39:01,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2018-11-23 06:39:01,417 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 32 states. [2018-11-23 06:39:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:02,947 INFO L93 Difference]: Finished difference Result 255 states and 278 transitions. [2018-11-23 06:39:02,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 06:39:02,947 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2018-11-23 06:39:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:02,950 INFO L225 Difference]: With dead ends: 255 [2018-11-23 06:39:02,950 INFO L226 Difference]: Without dead ends: 255 [2018-11-23 06:39:02,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=372, Invalid=2490, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 06:39:02,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-23 06:39:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 148. [2018-11-23 06:39:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-23 06:39:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2018-11-23 06:39:02,955 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 42 [2018-11-23 06:39:02,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:02,955 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2018-11-23 06:39:02,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 06:39:02,955 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2018-11-23 06:39:02,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 06:39:02,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:02,956 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:39:02,956 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:39:02,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:02,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1353917894, now seen corresponding path program 1 times [2018-11-23 06:39:02,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:02,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:02,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:02,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:02,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 06:39:02,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:39:02,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 06:39:02,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:39:02,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:39:02,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:39:02,998 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 6 states. [2018-11-23 06:39:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:03,121 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-11-23 06:39:03,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:39:03,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-23 06:39:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:03,123 INFO L225 Difference]: With dead ends: 118 [2018-11-23 06:39:03,123 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 06:39:03,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:39:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 06:39:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2018-11-23 06:39:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 06:39:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-11-23 06:39:03,126 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 43 [2018-11-23 06:39:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:03,126 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-11-23 06:39:03,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:39:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-11-23 06:39:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 06:39:03,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:03,127 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 06:39:03,127 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:39:03,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:03,127 INFO L82 PathProgramCache]: Analyzing trace with hash -389524194, now seen corresponding path program 2 times [2018-11-23 06:39:03,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:03,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:03,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:03,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:03,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:03,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:39:03,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:39:03,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:39:03,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:39:03,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:39:03,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:03,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:39:03,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:03,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:03,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:39:03,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-23 06:39:03,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:39:03,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:03,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:39:03,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:03,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-11-23 06:39:03,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:03,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-11-23 06:39:03,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 06:39:03,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:03,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 06:39:03,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-23 06:39:03,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:68 [2018-11-23 06:39:03,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2018-11-23 06:39:03,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:03,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-11-23 06:39:03,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2018-11-23 06:39:03,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:03,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-11-23 06:39:03,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:136, output treesize:58 [2018-11-23 06:39:03,747 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:39:03,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-23 06:39:03,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:03,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:56 [2018-11-23 06:39:03,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-11-23 06:39:03,829 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:39:03,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 22 [2018-11-23 06:39:03,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 06:39:03,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:03,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:03,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 06:39:03,855 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:39:03,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 06:39:03,856 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:39:03,862 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:03,869 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:74, output treesize:7 [2018-11-23 06:39:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:03,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:39:03,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2018-11-23 06:39:03,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 06:39:03,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 06:39:03,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2018-11-23 06:39:03,927 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 31 states. [2018-11-23 06:39:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:04,852 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-11-23 06:39:04,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 06:39:04,853 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2018-11-23 06:39:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:04,853 INFO L225 Difference]: With dead ends: 124 [2018-11-23 06:39:04,853 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 06:39:04,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=229, Invalid=1493, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 06:39:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 06:39:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2018-11-23 06:39:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 06:39:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-11-23 06:39:04,856 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 44 [2018-11-23 06:39:04,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:04,856 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-11-23 06:39:04,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 06:39:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-11-23 06:39:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 06:39:04,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:04,857 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 06:39:04,857 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:39:04,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:04,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1154571308, now seen corresponding path program 3 times [2018-11-23 06:39:04,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:04,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:04,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:04,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:39:04,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:05,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:39:05,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:39:05,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:39:05,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 06:39:05,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:39:05,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:05,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:39:05,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-23 06:39:05,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:39:05,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:05,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-11-23 06:39:05,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 06:39:05,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:05,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-23 06:39:05,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 06:39:05,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 06:39:05,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:31 [2018-11-23 06:39:05,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:39:05,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-11-23 06:39:05,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 06:39:05,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 06:39:05,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2018-11-23 06:39:05,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 65 [2018-11-23 06:39:05,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-11-23 06:39:05,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 39 [2018-11-23 06:39:05,360 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 06:39:05,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:39:05,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 06:39:05,386 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:83 [2018-11-23 06:39:05,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 79 [2018-11-23 06:39:05,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2018-11-23 06:39:05,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 73 [2018-11-23 06:39:05,508 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 06:39:05,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:39:05,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-11-23 06:39:05,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:05,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 06:39:05,559 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,565 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 06:39:05,584 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:155, output treesize:113 [2018-11-23 06:39:05,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2018-11-23 06:39:05,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-11-23 06:39:05,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,767 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:39:05,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 06:39:05,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 06:39:05,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-11-23 06:39:05,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:39:05,819 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,825 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:39:05,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 06:39:05,825 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,829 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:05,837 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2018-11-23 06:39:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:05,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:39:05,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2018-11-23 06:39:05,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 06:39:05,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 06:39:05,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=869, Unknown=1, NotChecked=0, Total=992 [2018-11-23 06:39:05,869 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 32 states. [2018-11-23 06:39:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:06,891 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-11-23 06:39:06,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 06:39:06,891 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-11-23 06:39:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:06,892 INFO L225 Difference]: With dead ends: 161 [2018-11-23 06:39:06,892 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 06:39:06,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=368, Invalid=2077, Unknown=5, NotChecked=0, Total=2450 [2018-11-23 06:39:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 06:39:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 122. [2018-11-23 06:39:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 06:39:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-11-23 06:39:06,895 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 45 [2018-11-23 06:39:06,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:06,895 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-11-23 06:39:06,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 06:39:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-11-23 06:39:06,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 06:39:06,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:06,896 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 06:39:06,896 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:39:06,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:06,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1154571309, now seen corresponding path program 2 times [2018-11-23 06:39:06,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:06,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:06,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:06,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:39:06,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:07,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:39:07,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:39:07,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:39:07,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:39:07,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:39:07,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:07,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 06:39:07,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-23 06:39:07,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:39:07,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:07,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:39:07,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:07,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-23 06:39:07,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 06:39:07,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 06:39:07,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-11-23 06:39:07,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:07,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:61 [2018-11-23 06:39:07,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2018-11-23 06:39:07,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-11-23 06:39:07,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-11-23 06:39:07,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 06:39:07,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:68 [2018-11-23 06:39:07,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-11-23 06:39:07,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 06:39:07,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:75 [2018-11-23 06:39:07,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 06:39:07,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 06:39:07,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-11-23 06:39:07,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 06:39:07,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2018-11-23 06:39:07,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-23 06:39:07,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 06:39:07,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2018-11-23 06:39:07,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:07,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:07,692 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:99 [2018-11-23 06:39:07,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-11-23 06:39:07,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-11-23 06:39:07,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 99 [2018-11-23 06:39:07,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:07,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-11-23 06:39:07,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:07,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:190, output treesize:104 [2018-11-23 06:39:07,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 66 [2018-11-23 06:39:07,900 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:39:07,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 06:39:07,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 06:39:07,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:07,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:39:07,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:07,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 06:39:07,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:39:07,939 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,943 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:39:07,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 06:39:07,944 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,946 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:07,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:07,954 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:121, output treesize:18 [2018-11-23 06:39:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:08,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:39:08,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2018-11-23 06:39:08,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 06:39:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 06:39:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 06:39:08,024 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 35 states. [2018-11-23 06:39:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:09,466 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2018-11-23 06:39:09,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 06:39:09,466 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2018-11-23 06:39:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:09,466 INFO L225 Difference]: With dead ends: 166 [2018-11-23 06:39:09,466 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 06:39:09,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=454, Invalid=2738, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 06:39:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 06:39:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2018-11-23 06:39:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 06:39:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-11-23 06:39:09,469 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 45 [2018-11-23 06:39:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:09,469 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-11-23 06:39:09,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 06:39:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-11-23 06:39:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 06:39:09,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:09,470 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 06:39:09,470 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:39:09,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:09,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1671435109, now seen corresponding path program 1 times [2018-11-23 06:39:09,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:09,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:09,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:39:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:09,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:39:09,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:39:09,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:09,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:09,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:09,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:09,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 06:39:09,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-23 06:39:09,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:39:09,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:09,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:39:09,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:09,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-23 06:39:09,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:09,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-23 06:39:09,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-23 06:39:09,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:09,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-11-23 06:39:09,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 06:39:09,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-11-23 06:39:09,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:09,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-23 06:39:09,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:09,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 06:39:09,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2018-11-23 06:39:09,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:09,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-23 06:39:09,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,936 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2018-11-23 06:39:09,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:09,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:09,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:09,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-11-23 06:39:09,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:09,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2018-11-23 06:39:09,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:09,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-23 06:39:09,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-11-23 06:39:09,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-11-23 06:39:10,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-11-23 06:39:10,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2018-11-23 06:39:10,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:10,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 88 [2018-11-23 06:39:10,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:10,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:10,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:10,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2018-11-23 06:39:10,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:10,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,180 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:120, output treesize:100 [2018-11-23 06:39:10,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 164 [2018-11-23 06:39:10,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:10,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-23 06:39:10,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 128 [2018-11-23 06:39:10,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:10,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-23 06:39:10,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:10,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:231, output treesize:121 [2018-11-23 06:39:10,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2018-11-23 06:39:10,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:39:10,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2018-11-23 06:39:10,380 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:10,394 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-11-23 06:39:10,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2018-11-23 06:39:10,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:39:10,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 06:39:10,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:10,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-23 06:39:10,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:10,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:10,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:10,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-11-23 06:39:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:10,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:39:10,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-11-23 06:39:10,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 06:39:10,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 06:39:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 06:39:10,563 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 36 states. [2018-11-23 06:39:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:11,496 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2018-11-23 06:39:11,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 06:39:11,496 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2018-11-23 06:39:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:11,497 INFO L225 Difference]: With dead ends: 164 [2018-11-23 06:39:11,497 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 06:39:11,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=2025, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 06:39:11,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 06:39:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2018-11-23 06:39:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 06:39:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2018-11-23 06:39:11,499 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 46 [2018-11-23 06:39:11,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:11,499 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2018-11-23 06:39:11,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 06:39:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2018-11-23 06:39:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 06:39:11,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:11,500 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 06:39:11,500 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:39:11,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:11,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1671435108, now seen corresponding path program 1 times [2018-11-23 06:39:11,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:11,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:11,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:11,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:11,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:11,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:39:11,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:39:11,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:11,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:11,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:11,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:11,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 06:39:11,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:11,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:11,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-23 06:39:11,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:39:11,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:11,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:11,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:11,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:39:11,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:11,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:11,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:11,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:11,893 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-23 06:39:11,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:11,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-11-23 06:39:11,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 06:39:11,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:11,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:11,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:11,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 06:39:12,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-23 06:39:12,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-11-23 06:39:12,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-11-23 06:39:12,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-23 06:39:12,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-23 06:39:12,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 06:39:12,109 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2018-11-23 06:39:12,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 06:39:12,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:39:12,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:76 [2018-11-23 06:39:12,195 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:39:12,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 67 [2018-11-23 06:39:12,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 06:39:12,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-11-23 06:39:12,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-11-23 06:39:12,227 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:95, output treesize:86 [2018-11-23 06:39:12,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 119 [2018-11-23 06:39:12,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:12,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 103 [2018-11-23 06:39:12,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:39:12,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:101 [2018-11-23 06:39:12,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 206 [2018-11-23 06:39:12,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-23 06:39:12,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 127 [2018-11-23 06:39:12,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:39:12,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-23 06:39:12,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:12,503 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:232, output treesize:122 [2018-11-23 06:39:12,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2018-11-23 06:39:12,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:39:12,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 23 [2018-11-23 06:39:12,685 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-23 06:39:12,695 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:12,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:39:12,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-23 06:39:12,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:39:12,719 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 06:39:12,725 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:39:12,728 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,729 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:39:12,733 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:152, output treesize:9 [2018-11-23 06:39:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:12,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:39:12,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2018-11-23 06:39:12,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 06:39:12,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 06:39:12,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 06:39:12,759 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 33 states. [2018-11-23 06:39:13,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:13,789 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-11-23 06:39:13,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 06:39:13,791 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46 [2018-11-23 06:39:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:13,792 INFO L225 Difference]: With dead ends: 162 [2018-11-23 06:39:13,792 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 06:39:13,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=1921, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 06:39:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 06:39:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 126. [2018-11-23 06:39:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 06:39:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-11-23 06:39:13,795 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 46 [2018-11-23 06:39:13,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:13,795 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-11-23 06:39:13,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 06:39:13,795 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-11-23 06:39:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 06:39:13,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:13,796 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 06:39:13,796 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-23 06:39:13,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash 68631713, now seen corresponding path program 1 times [2018-11-23 06:39:13,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:13,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:13,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:13,836 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=16, |#NULL.offset|=9, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] RET #196#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 VAL [main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 VAL [main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1005 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1005-1 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~mem3.base|=12, |main_#t~mem3.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1007 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~nondet4|=0] [?] assume !(0 != #t~nondet4);havoc #t~nondet4; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1015 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1016 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1016-1 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem6.base|=22, |main_#t~mem6.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1018 VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1018-1 VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] goto; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1028-3 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem7|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] goto; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1032 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem8|=1] [?] assume !(~unnamed1~0~RED == #t~mem8);havoc #t~mem8; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1038-3 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem11.base|=12, |main_#t~mem11.offset|=0] [?] assume !(#t~mem11.base == 0 && #t~mem11.offset == 0);havoc #t~mem11.base, #t~mem11.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] goto; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1038-4 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem12.base|=12, |main_#t~mem12.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1032 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem8|=0] [?] assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1034 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem9.base|=22, |main_#t~mem9.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1035 VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem10.base|=0, |main_#t~mem10.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; VAL [main_~end~0.base=0, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] assume !(1 == #valid[~end~0.base]); VAL [main_~end~0.base=0, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=9, old(#NULL.base)=16, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L995] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L995] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L996] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L999] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~nondet1=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002-L1021] assume !!(0 != #t~nondet1); [L1002] havoc #t~nondet1; [L1005] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1005] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1006] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~mem3.base=12, #t~mem3.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1006] ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset; [L1006] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1007] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1009] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~nondet4=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1009-L1020] assume !(0 != #t~nondet4); [L1009] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1015] call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1016] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1016] call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1017] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem6.base=22, #t~mem6.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1017] ~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset; [L1017] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1018] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1019] call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~nondet1=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002-L1021] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1023] ~end~0.base, ~end~0.offset := 0, 0; [L1024] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1027] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1028] call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem7=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == #t~mem7); [L1028] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem8=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032-L1036] assume !(~unnamed1~0~RED == #t~mem8); [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem11.base=12, #t~mem11.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] assume !(#t~mem11.base == 0 && #t~mem11.offset == 0); [L1038] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1039] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem12.base=12, #t~mem12.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1039] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1039] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem8=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032-L1036] assume ~unnamed1~0~RED == #t~mem8; [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1034] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem9.base=22, #t~mem9.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1034] ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset; [L1034] havoc #t~mem9.base, #t~mem9.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1035] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem10.base=0, #t~mem10.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1035] ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; [L1035] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=9, old(#NULL.base)=16, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L995] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L995] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L996] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L999] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~nondet1=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002-L1021] assume !!(0 != #t~nondet1); [L1002] havoc #t~nondet1; [L1005] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1005] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1006] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~mem3.base=12, #t~mem3.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1006] ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset; [L1006] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1007] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1009] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~nondet4=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1009-L1020] assume !(0 != #t~nondet4); [L1009] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1015] call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1016] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1016] call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1017] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem6.base=22, #t~mem6.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1017] ~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset; [L1017] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1018] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1019] call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~nondet1=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002-L1021] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1023] ~end~0.base, ~end~0.offset := 0, 0; [L1024] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1027] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1028] call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem7=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == #t~mem7); [L1028] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem8=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032-L1036] assume !(~unnamed1~0~RED == #t~mem8); [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem11.base=12, #t~mem11.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] assume !(#t~mem11.base == 0 && #t~mem11.offset == 0); [L1038] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1039] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem12.base=12, #t~mem12.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1039] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1039] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem8=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032-L1036] assume ~unnamed1~0~RED == #t~mem8; [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1034] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem9.base=22, #t~mem9.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1034] ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset; [L1034] havoc #t~mem9.base, #t~mem9.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1035] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem10.base=0, #t~mem10.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1035] ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; [L1035] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002-L1021] COND FALSE !(!(0 != #t~nondet1)) [L1002] havoc #t~nondet1; [L1005] FCALL call #t~malloc2 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1005] FCALL call write~$Pointer$(#t~malloc2, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1006] FCALL call #t~mem3 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~mem3!base=12, #t~mem3!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1006] ~end~0 := #t~mem3; [L1006] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1007] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1009] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~nondet4=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1009-L1020] COND FALSE !(0 != #t~nondet4) [L1009] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1015] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1016] FCALL call #t~malloc5 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1016] FCALL call write~$Pointer$(#t~malloc5, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1017] FCALL call #t~mem6 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem6!base=22, #t~mem6!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1017] ~end~0 := #t~mem6; [L1017] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1018] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~nondet1=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem7=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem8=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem11!base=12, #t~mem11!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] COND FALSE !(#t~mem11 == { base: 0, offset: 0 }) [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1039] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem12!base=12, #t~mem12!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1039] ~end~0 := #t~mem12; [L1039] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] COND TRUE ~unnamed1~0~RED == #t~mem8 [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1034] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem9!base=22, #t~mem9!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1034] ~end~0 := #t~mem9; [L1034] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1035] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem10!base=0, #t~mem10!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1035] ~end~0 := #t~mem10; [L1035] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002-L1021] COND FALSE !(!(0 != #t~nondet1)) [L1002] havoc #t~nondet1; [L1005] FCALL call #t~malloc2 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1005] FCALL call write~$Pointer$(#t~malloc2, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1006] FCALL call #t~mem3 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~mem3!base=12, #t~mem3!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1006] ~end~0 := #t~mem3; [L1006] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1007] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1009] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~nondet4=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1009-L1020] COND FALSE !(0 != #t~nondet4) [L1009] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1015] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1016] FCALL call #t~malloc5 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1016] FCALL call write~$Pointer$(#t~malloc5, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1017] FCALL call #t~mem6 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem6!base=22, #t~mem6!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1017] ~end~0 := #t~mem6; [L1017] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1018] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~nondet1=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem7=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem8=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem11!base=12, #t~mem11!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] COND FALSE !(#t~mem11 == { base: 0, offset: 0 }) [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1039] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem12!base=12, #t~mem12!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1039] ~end~0 := #t~mem12; [L1039] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] COND TRUE ~unnamed1~0~RED == #t~mem8 [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1034] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem9!base=22, #t~mem9!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1034] ~end~0 := #t~mem9; [L1034] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1035] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem10!base=0, #t~mem10!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1035] ~end~0 := #t~mem10; [L1035] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L996] list->next = ((void*)0) VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L997] list->colour = BLACK VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L999] SLL* end = list; VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1006] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1006] end = end->next [L1007] end->next = ((void*)0) VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] end->colour = RED VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1016] end->next = malloc(sizeof(SLL)) VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1017] EXPR end->next VAL [end={12:0}, end->next={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1017] end = end->next [L1018] end->next = ((void*)0) VAL [end={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1019] end->colour = BLACK VAL [end={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1028] EXPR end->colour VAL [end={20:0}, end->colour=1, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] EXPR end->colour VAL [end={20:0}, end->colour=1, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1038] COND FALSE !(!(end->next)) [L1039] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] EXPR end->colour VAL [end={12:0}, end->colour=0, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR end->next VAL [end={12:0}, end->next={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1034] end = end->next [L1035] EXPR end->next VAL [end={22:0}, end->next={0:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1035] end = end->next [L1038] end->next ----- [2018-11-23 06:39:13,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:39:13 BoogieIcfgContainer [2018-11-23 06:39:13,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:39:13,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:39:13,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:39:13,945 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:39:13,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:50" (3/4) ... [2018-11-23 06:39:13,947 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=16, |#NULL.offset|=9, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] RET #196#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 VAL [main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 VAL [main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1005 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1005-1 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~mem3.base|=12, |main_#t~mem3.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1007 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~nondet4|=0] [?] assume !(0 != #t~nondet4);havoc #t~nondet4; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1015 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0] [?] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1016 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1016-1 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem6.base|=22, |main_#t~mem6.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1018 VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1018-1 VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] goto; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1028-3 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem7|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] goto; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1032 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem8|=1] [?] assume !(~unnamed1~0~RED == #t~mem8);havoc #t~mem8; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1038-3 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem11.base|=12, |main_#t~mem11.offset|=0] [?] assume !(#t~mem11.base == 0 && #t~mem11.offset == 0);havoc #t~mem11.base, #t~mem11.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] goto; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1038-4 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem12.base|=12, |main_#t~mem12.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1032 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem8|=0] [?] assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1034 VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem9.base|=22, |main_#t~mem9.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1035 VAL [main_~end~0.base=22, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0, |main_#t~mem10.base|=0, |main_#t~mem10.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; VAL [main_~end~0.base=0, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] assume !(1 == #valid[~end~0.base]); VAL [main_~end~0.base=0, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=12, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=22, |main_#t~malloc5.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=9, old(#NULL.base)=16, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L995] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L995] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L996] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L999] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~nondet1=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002-L1021] assume !!(0 != #t~nondet1); [L1002] havoc #t~nondet1; [L1005] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1005] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1006] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~mem3.base=12, #t~mem3.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1006] ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset; [L1006] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1007] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1009] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~nondet4=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1009-L1020] assume !(0 != #t~nondet4); [L1009] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1015] call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1016] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1016] call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1017] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem6.base=22, #t~mem6.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1017] ~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset; [L1017] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1018] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1019] call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~nondet1=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002-L1021] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1023] ~end~0.base, ~end~0.offset := 0, 0; [L1024] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1027] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1028] call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem7=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == #t~mem7); [L1028] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem8=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032-L1036] assume !(~unnamed1~0~RED == #t~mem8); [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem11.base=12, #t~mem11.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] assume !(#t~mem11.base == 0 && #t~mem11.offset == 0); [L1038] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1039] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem12.base=12, #t~mem12.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1039] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1039] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem8=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032-L1036] assume ~unnamed1~0~RED == #t~mem8; [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1034] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem9.base=22, #t~mem9.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1034] ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset; [L1034] havoc #t~mem9.base, #t~mem9.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1035] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem10.base=0, #t~mem10.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1035] ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; [L1035] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=9, old(#NULL.base)=16, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L995] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L995] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L996] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L999] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~nondet1=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002-L1021] assume !!(0 != #t~nondet1); [L1002] havoc #t~nondet1; [L1005] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1005] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1006] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~mem3.base=12, #t~mem3.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1006] ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset; [L1006] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1007] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1009] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~nondet4=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1009-L1020] assume !(0 != #t~nondet4); [L1009] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1015] call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1016] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1016] call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1017] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem6.base=22, #t~mem6.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1017] ~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset; [L1017] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1018] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1019] call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~nondet1=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1002-L1021] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1023] ~end~0.base, ~end~0.offset := 0, 0; [L1024] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1027] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1028] call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem7=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == #t~mem7); [L1028] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem8=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032-L1036] assume !(~unnamed1~0~RED == #t~mem8); [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem11.base=12, #t~mem11.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] assume !(#t~mem11.base == 0 && #t~mem11.offset == 0); [L1038] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1039] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem12.base=12, #t~mem12.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1039] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1039] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem8=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1032-L1036] assume ~unnamed1~0~RED == #t~mem8; [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1034] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem9.base=22, #t~mem9.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1034] ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset; [L1034] havoc #t~mem9.base, #t~mem9.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1035] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, #t~mem10.base=0, #t~mem10.offset=0, ~end~0.base=22, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1035] ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; [L1035] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc2.base=12, #t~malloc2.offset=0, #t~malloc5.base=22, #t~malloc5.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002-L1021] COND FALSE !(!(0 != #t~nondet1)) [L1002] havoc #t~nondet1; [L1005] FCALL call #t~malloc2 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1005] FCALL call write~$Pointer$(#t~malloc2, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1006] FCALL call #t~mem3 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~mem3!base=12, #t~mem3!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1006] ~end~0 := #t~mem3; [L1006] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1007] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1009] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~nondet4=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1009-L1020] COND FALSE !(0 != #t~nondet4) [L1009] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1015] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1016] FCALL call #t~malloc5 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1016] FCALL call write~$Pointer$(#t~malloc5, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1017] FCALL call #t~mem6 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem6!base=22, #t~mem6!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1017] ~end~0 := #t~mem6; [L1017] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1018] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~nondet1=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem7=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem8=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem11!base=12, #t~mem11!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] COND FALSE !(#t~mem11 == { base: 0, offset: 0 }) [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1039] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem12!base=12, #t~mem12!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1039] ~end~0 := #t~mem12; [L1039] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] COND TRUE ~unnamed1~0~RED == #t~mem8 [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1034] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem9!base=22, #t~mem9!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1034] ~end~0 := #t~mem9; [L1034] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1035] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem10!base=0, #t~mem10!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1035] ~end~0 := #t~mem10; [L1035] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002-L1021] COND FALSE !(!(0 != #t~nondet1)) [L1002] havoc #t~nondet1; [L1005] FCALL call #t~malloc2 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1005] FCALL call write~$Pointer$(#t~malloc2, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1006] FCALL call #t~mem3 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~mem3!base=12, #t~mem3!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1006] ~end~0 := #t~mem3; [L1006] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1007] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1009] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~nondet4=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1009-L1020] COND FALSE !(0 != #t~nondet4) [L1009] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1015] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1016] FCALL call #t~malloc5 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1016] FCALL call write~$Pointer$(#t~malloc5, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1017] FCALL call #t~mem6 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem6!base=22, #t~mem6!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1017] ~end~0 := #t~mem6; [L1017] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1018] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~nondet1=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem7=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem8=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem11!base=12, #t~mem11!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] COND FALSE !(#t~mem11 == { base: 0, offset: 0 }) [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1039] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem12!base=12, #t~mem12!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1039] ~end~0 := #t~mem12; [L1039] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1032] COND TRUE ~unnamed1~0~RED == #t~mem8 [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1034] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem9!base=22, #t~mem9!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1034] ~end~0 := #t~mem9; [L1034] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1035] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, #t~mem10!base=0, #t~mem10!offset=0, ~end~0!base=22, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1035] ~end~0 := #t~mem10; [L1035] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc2!base=12, #t~malloc2!offset=0, #t~malloc5!base=22, #t~malloc5!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0] [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L996] list->next = ((void*)0) VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L997] list->colour = BLACK VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L999] SLL* end = list; VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1006] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1006] end = end->next [L1007] end->next = ((void*)0) VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] end->colour = RED VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1016] end->next = malloc(sizeof(SLL)) VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1017] EXPR end->next VAL [end={12:0}, end->next={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1017] end = end->next [L1018] end->next = ((void*)0) VAL [end={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1019] end->colour = BLACK VAL [end={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1028] EXPR end->colour VAL [end={20:0}, end->colour=1, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] EXPR end->colour VAL [end={20:0}, end->colour=1, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1038] COND FALSE !(!(end->next)) [L1039] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] EXPR end->colour VAL [end={12:0}, end->colour=0, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR end->next VAL [end={12:0}, end->next={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1034] end = end->next [L1035] EXPR end->next VAL [end={22:0}, end->next={0:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1035] end = end->next [L1038] end->next ----- [2018-11-23 06:39:14,284 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3a960d40-f902-4b45-a606-6ddd28f60586/bin-2019/uautomizer/witness.graphml [2018-11-23 06:39:14,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:39:14,285 INFO L168 Benchmark]: Toolchain (without parser) took 24280.17 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 504.9 MB). Free memory was 955.4 MB in the beginning and 1.4 GB in the end (delta: -458.7 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:14,286 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:39:14,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:14,287 INFO L168 Benchmark]: Boogie Preprocessor took 38.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:14,287 INFO L168 Benchmark]: RCFGBuilder took 488.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:14,287 INFO L168 Benchmark]: TraceAbstraction took 23088.82 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -352.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:39:14,287 INFO L168 Benchmark]: Witness Printer took 339.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:14,288 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 488.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23088.82 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -352.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 339.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L996] list->next = ((void*)0) VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L997] list->colour = BLACK VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L999] SLL* end = list; VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1006] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1006] end = end->next [L1007] end->next = ((void*)0) VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] end->colour = RED VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1016] end->next = malloc(sizeof(SLL)) VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1017] EXPR end->next VAL [end={12:0}, end->next={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1017] end = end->next [L1018] end->next = ((void*)0) VAL [end={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1019] end->colour = BLACK VAL [end={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1028] EXPR end->colour VAL [end={20:0}, end->colour=1, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] EXPR end->colour VAL [end={20:0}, end->colour=1, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1038] COND FALSE !(!(end->next)) [L1039] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] EXPR end->colour VAL [end={12:0}, end->colour=0, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR end->next VAL [end={12:0}, end->next={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1034] end = end->next [L1035] EXPR end->next VAL [end={22:0}, end->next={0:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={22:0}] [L1035] end = end->next [L1038] end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 112 locations, 49 error locations. UNSAFE Result, 23.0s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 12.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1278 SDtfs, 4383 SDslu, 6021 SDs, 0 SdLazy, 13054 SolverSat, 902 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 829 GetRequests, 295 SyntacticMatches, 42 SemanticMatches, 492 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4880 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 905 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1120 NumberOfCodeBlocks, 1120 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 183 QuantifiedInterpolants, 1197925 SizeOfPredicates, 168 NumberOfNonLiveVariables, 1916 ConjunctsInSsa, 483 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 14/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...