./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-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_d3e4063b-dce0-42f9-aa66-7cdee7f44092/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 1f270b702de634d3ad2ee5a400388c6410a4cf10 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:45:37,693 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:45:37,694 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:45:37,701 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:45:37,701 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:45:37,702 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:45:37,702 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:45:37,703 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:45:37,704 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:45:37,705 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:45:37,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:45:37,706 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:45:37,707 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:45:37,707 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:45:37,708 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:45:37,708 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:45:37,709 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:45:37,710 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:45:37,712 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:45:37,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:45:37,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:45:37,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:45:37,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:45:37,716 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:45:37,716 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:45:37,717 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:45:37,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:45:37,718 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:45:37,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:45:37,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:45:37,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:45:37,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:45:37,720 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:45:37,720 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:45:37,721 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:45:37,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:45:37,721 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 14:45:37,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:45:37,731 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:45:37,732 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:45:37,732 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:45:37,732 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:45:37,733 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:45:37,733 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:45:37,733 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:45:37,733 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:45:37,733 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:45:37,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:45:37,733 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:45:37,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:45:37,734 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 14:45:37,734 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 14:45:37,734 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 14:45:37,734 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:45:37,734 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:45:37,734 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:45:37,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:45:37,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:45:37,735 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:45:37,735 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:45:37,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:45:37,735 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:45:37,735 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:45:37,735 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:45:37,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:45:37,735 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_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2018-11-23 14:45:37,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:45:37,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:45:37,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:45:37,767 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:45:37,767 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:45:37,768 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-23 14:45:37,803 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/bin-2019/uautomizer/data/e29999722/c5bfa91fa8d148cfada48d79de95ba61/FLAGfe3969668 [2018-11-23 14:45:38,242 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:45:38,242 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-23 14:45:38,249 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/bin-2019/uautomizer/data/e29999722/c5bfa91fa8d148cfada48d79de95ba61/FLAGfe3969668 [2018-11-23 14:45:38,259 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/bin-2019/uautomizer/data/e29999722/c5bfa91fa8d148cfada48d79de95ba61 [2018-11-23 14:45:38,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:45:38,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 14:45:38,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:45:38,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:45:38,268 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:45:38,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:45:38" (1/1) ... [2018-11-23 14:45:38,271 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 02:45:38, skipping insertion in model container [2018-11-23 14:45:38,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:45:38" (1/1) ... [2018-11-23 14:45:38,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:45:38,311 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:45:38,516 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:45:38,521 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:45:38,594 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:45:38,618 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:45:38,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:38 WrapperNode [2018-11-23 14:45:38,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:45:38,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:45:38,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:45:38,619 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:45:38,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:38" (1/1) ... [2018-11-23 14:45:38,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:38" (1/1) ... [2018-11-23 14:45:38,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:38" (1/1) ... [2018-11-23 14:45:38,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:38" (1/1) ... [2018-11-23 14:45:38,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:38" (1/1) ... [2018-11-23 14:45:38,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:38" (1/1) ... [2018-11-23 14:45:38,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:38" (1/1) ... [2018-11-23 14:45:38,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:45:38,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:45:38,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:45:38,663 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:45:38,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 14:45:38,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:45:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:45:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:45:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-23 14:45:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-23 14:45:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-23 14:45:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-23 14:45:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-23 14:45:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-23 14:45:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-23 14:45:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-23 14:45:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-23 14:45:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-23 14:45:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-23 14:45:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-23 14:45:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-23 14:45:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-23 14:45:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-23 14:45:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-23 14:45:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-23 14:45:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-23 14:45:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-23 14:45:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-23 14:45:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-23 14:45:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-23 14:45:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-23 14:45:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-23 14:45:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-23 14:45:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-23 14:45:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-23 14:45:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-23 14:45:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-23 14:45:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-23 14:45:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-23 14:45:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-23 14:45:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-23 14:45:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-23 14:45:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-23 14:45:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-23 14:45:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-23 14:45:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-23 14:45:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-23 14:45:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-23 14:45:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-23 14:45:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-23 14:45:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-23 14:45:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-23 14:45:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-23 14:45:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-23 14:45:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-23 14:45:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-23 14:45:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-23 14:45:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-23 14:45:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-23 14:45:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-23 14:45:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-23 14:45:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-23 14:45:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-23 14:45:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-23 14:45:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-23 14:45:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-23 14:45:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-23 14:45:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-23 14:45:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-23 14:45:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-23 14:45:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-23 14:45:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 14:45:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-23 14:45:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-23 14:45:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-23 14:45:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-23 14:45:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-23 14:45:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-23 14:45:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-23 14:45:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-23 14:45:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-23 14:45:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-23 14:45:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-23 14:45:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-23 14:45:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-23 14:45:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-23 14:45:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-23 14:45:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-23 14:45:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-23 14:45:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-23 14:45:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-23 14:45:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-23 14:45:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-23 14:45:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-23 14:45:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-23 14:45:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-23 14:45:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-23 14:45:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-23 14:45:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-23 14:45:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-23 14:45:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-23 14:45:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-23 14:45:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-23 14:45:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-23 14:45:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-23 14:45:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-23 14:45:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-23 14:45:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-23 14:45:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-23 14:45:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-23 14:45:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-23 14:45:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-23 14:45:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-23 14:45:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:45:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:45:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 14:45:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:45:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 14:45:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:45:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:45:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:45:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:45:39,159 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:45:39,159 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 14:45:39,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:45:39 BoogieIcfgContainer [2018-11-23 14:45:39,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:45:39,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:45:39,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:45:39,163 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:45:39,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:45:38" (1/3) ... [2018-11-23 14:45:39,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c48927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:45:39, skipping insertion in model container [2018-11-23 14:45:39,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:38" (2/3) ... [2018-11-23 14:45:39,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c48927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:45:39, skipping insertion in model container [2018-11-23 14:45:39,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:45:39" (3/3) ... [2018-11-23 14:45:39,166 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-23 14:45:39,173 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:45:39,180 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-11-23 14:45:39,189 INFO L257 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2018-11-23 14:45:39,205 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:45:39,206 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:45:39,206 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 14:45:39,206 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:45:39,206 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:45:39,206 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:45:39,206 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:45:39,207 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:45:39,207 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:45:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2018-11-23 14:45:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:45:39,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:39,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:39,229 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:39,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash 922504407, now seen corresponding path program 1 times [2018-11-23 14:45:39,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:39,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:39,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:39,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:39,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:39,344 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 14:45:39,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:39,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:45:39,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:45:39,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:45:39,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:45:39,358 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2018-11-23 14:45:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:39,505 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-11-23 14:45:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:45:39,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 14:45:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:39,513 INFO L225 Difference]: With dead ends: 129 [2018-11-23 14:45:39,513 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 14:45:39,514 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 14:45:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 14:45:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2018-11-23 14:45:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 14:45:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-11-23 14:45:39,538 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 7 [2018-11-23 14:45:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:39,538 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-11-23 14:45:39,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:45:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-11-23 14:45:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:45:39,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:39,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:39,539 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:39,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:39,540 INFO L82 PathProgramCache]: Analyzing trace with hash 922504408, now seen corresponding path program 1 times [2018-11-23 14:45:39,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:39,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:39,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:39,572 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 14:45:39,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:39,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:45:39,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:45:39,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:45:39,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:45:39,574 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 3 states. [2018-11-23 14:45:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:39,723 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-11-23 14:45:39,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:45:39,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 14:45:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:39,724 INFO L225 Difference]: With dead ends: 134 [2018-11-23 14:45:39,725 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 14:45:39,725 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 14:45:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 14:45:39,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2018-11-23 14:45:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 14:45:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-11-23 14:45:39,733 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 7 [2018-11-23 14:45:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:39,733 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-11-23 14:45:39,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:45:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-11-23 14:45:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 14:45:39,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:39,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:39,734 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:39,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:39,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681824, now seen corresponding path program 1 times [2018-11-23 14:45:39,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:39,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:39,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:39,785 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 14:45:39,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:39,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:45:39,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:45:39,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:45:39,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:45:39,786 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 4 states. [2018-11-23 14:45:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:39,943 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 14:45:39,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:45:39,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 14:45:39,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:39,944 INFO L225 Difference]: With dead ends: 130 [2018-11-23 14:45:39,944 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 14:45:39,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 14:45:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 14:45:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2018-11-23 14:45:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 14:45:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2018-11-23 14:45:39,951 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 13 [2018-11-23 14:45:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:39,951 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2018-11-23 14:45:39,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:45:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-11-23 14:45:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 14:45:39,952 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:39,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:39,952 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:39,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681823, now seen corresponding path program 1 times [2018-11-23 14:45:39,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:39,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:39,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:39,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:39,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:40,012 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 14:45:40,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:40,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:45:40,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:45:40,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:45:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:45:40,014 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 4 states. [2018-11-23 14:45:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:40,146 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-11-23 14:45:40,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:45:40,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 14:45:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:40,147 INFO L225 Difference]: With dead ends: 152 [2018-11-23 14:45:40,147 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 14:45:40,148 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 14:45:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 14:45:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2018-11-23 14:45:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 14:45:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-11-23 14:45:40,154 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 13 [2018-11-23 14:45:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:40,155 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-11-23 14:45:40,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:45:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2018-11-23 14:45:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 14:45:40,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:40,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:40,156 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:40,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:40,156 INFO L82 PathProgramCache]: Analyzing trace with hash 502811171, now seen corresponding path program 1 times [2018-11-23 14:45:40,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:40,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:40,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:40,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:40,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:40,196 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 14:45:40,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:40,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:45:40,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:45:40,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:45:40,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:45:40,198 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand 5 states. [2018-11-23 14:45:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:40,333 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-11-23 14:45:40,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:45:40,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 14:45:40,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:40,335 INFO L225 Difference]: With dead ends: 175 [2018-11-23 14:45:40,335 INFO L226 Difference]: Without dead ends: 175 [2018-11-23 14:45:40,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 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 14:45:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-23 14:45:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 126. [2018-11-23 14:45:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 14:45:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-11-23 14:45:40,339 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 15 [2018-11-23 14:45:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:40,340 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-11-23 14:45:40,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:45:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-11-23 14:45:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 14:45:40,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:40,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:40,341 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:40,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash 502811172, now seen corresponding path program 1 times [2018-11-23 14:45:40,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:40,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:40,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:40,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:40,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:40,396 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 14:45:40,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:40,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:45:40,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:45:40,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:45:40,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:45:40,397 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 5 states. [2018-11-23 14:45:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:40,567 INFO L93 Difference]: Finished difference Result 196 states and 215 transitions. [2018-11-23 14:45:40,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 14:45:40,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 14:45:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:40,568 INFO L225 Difference]: With dead ends: 196 [2018-11-23 14:45:40,568 INFO L226 Difference]: Without dead ends: 196 [2018-11-23 14:45:40,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 14:45:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-23 14:45:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 125. [2018-11-23 14:45:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 14:45:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2018-11-23 14:45:40,573 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 15 [2018-11-23 14:45:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:40,574 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2018-11-23 14:45:40,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:45:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2018-11-23 14:45:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:45:40,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:40,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:40,575 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:40,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:40,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1991341413, now seen corresponding path program 1 times [2018-11-23 14:45:40,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:40,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:40,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:40,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:40,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:40,675 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 14:45:40,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:40,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 14:45:40,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 14:45:40,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 14:45:40,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:45:40,676 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand 9 states. [2018-11-23 14:45:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:40,995 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-11-23 14:45:40,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:45:40,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-23 14:45:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:40,996 INFO L225 Difference]: With dead ends: 138 [2018-11-23 14:45:40,996 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 14:45:40,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-23 14:45:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 14:45:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-11-23 14:45:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 14:45:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-11-23 14:45:41,001 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 19 [2018-11-23 14:45:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:41,001 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-11-23 14:45:41,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 14:45:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-11-23 14:45:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:45:41,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:41,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:41,002 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:41,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:41,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1991341414, now seen corresponding path program 1 times [2018-11-23 14:45:41,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:41,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:41,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:41,107 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 14:45:41,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:41,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 14:45:41,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 14:45:41,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 14:45:41,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 14:45:41,108 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2018-11-23 14:45:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:41,485 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2018-11-23 14:45:41,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 14:45:41,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-23 14:45:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:41,486 INFO L225 Difference]: With dead ends: 141 [2018-11-23 14:45:41,486 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 14:45:41,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-11-23 14:45:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 14:45:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2018-11-23 14:45:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 14:45:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2018-11-23 14:45:41,489 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 19 [2018-11-23 14:45:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:41,489 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2018-11-23 14:45:41,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 14:45:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-11-23 14:45:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:45:41,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:41,490 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] [2018-11-23 14:45:41,490 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:41,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash 207481725, now seen corresponding path program 1 times [2018-11-23 14:45:41,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:41,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:41,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:41,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:41,525 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 14:45:41,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:41,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:45:41,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:45:41,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:45:41,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:45:41,526 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 4 states. [2018-11-23 14:45:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:41,600 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-11-23 14:45:41,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:45:41,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 14:45:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:41,601 INFO L225 Difference]: With dead ends: 135 [2018-11-23 14:45:41,601 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 14:45:41,601 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 14:45:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 14:45:41,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2018-11-23 14:45:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 14:45:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-11-23 14:45:41,604 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 22 [2018-11-23 14:45:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:41,604 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-11-23 14:45:41,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:45:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-11-23 14:45:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 14:45:41,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:41,606 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, 1] [2018-11-23 14:45:41,606 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:41,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:41,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1832807181, now seen corresponding path program 1 times [2018-11-23 14:45:41,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:41,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:41,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:41,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:41,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:41,676 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 14:45:41,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:41,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:45:41,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:45:41,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:45:41,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:45:41,677 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 5 states. [2018-11-23 14:45:41,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:41,786 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-11-23 14:45:41,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:45:41,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 14:45:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:41,787 INFO L225 Difference]: With dead ends: 124 [2018-11-23 14:45:41,788 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 14:45:41,788 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 14:45:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 14:45:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117. [2018-11-23 14:45:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 14:45:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-11-23 14:45:41,791 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 24 [2018-11-23 14:45:41,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:41,791 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-11-23 14:45:41,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:45:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-11-23 14:45:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:45:41,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:41,792 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, 1, 1, 1] [2018-11-23 14:45:41,792 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:41,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash -430750966, now seen corresponding path program 1 times [2018-11-23 14:45:41,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:41,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:41,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:41,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:41,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:41,825 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 14:45:41,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:41,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:45:41,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:45:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:45:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:45:41,826 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 5 states. [2018-11-23 14:45:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:42,029 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2018-11-23 14:45:42,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:45:42,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 14:45:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:42,030 INFO L225 Difference]: With dead ends: 175 [2018-11-23 14:45:42,030 INFO L226 Difference]: Without dead ends: 175 [2018-11-23 14:45:42,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 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 14:45:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-23 14:45:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 116. [2018-11-23 14:45:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 14:45:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-11-23 14:45:42,033 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 26 [2018-11-23 14:45:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:42,033 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-11-23 14:45:42,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:45:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-11-23 14:45:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:45:42,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:42,034 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, 1, 1, 1] [2018-11-23 14:45:42,034 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:42,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash -430750965, now seen corresponding path program 1 times [2018-11-23 14:45:42,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:42,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:42,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:42,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:42,074 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 14:45:42,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:42,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:45:42,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:45:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:45:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:45:42,075 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 5 states. [2018-11-23 14:45:42,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:42,241 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2018-11-23 14:45:42,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 14:45:42,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 14:45:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:42,243 INFO L225 Difference]: With dead ends: 199 [2018-11-23 14:45:42,243 INFO L226 Difference]: Without dead ends: 199 [2018-11-23 14:45:42,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 14:45:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-23 14:45:42,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 115. [2018-11-23 14:45:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 14:45:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-11-23 14:45:42,246 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 26 [2018-11-23 14:45:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:42,246 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-11-23 14:45:42,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:45:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-11-23 14:45:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 14:45:42,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:42,247 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] [2018-11-23 14:45:42,247 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:42,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:42,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1604048439, now seen corresponding path program 1 times [2018-11-23 14:45:42,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:42,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:42,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:42,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:42,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:42,322 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 14:45:42,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:42,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:45:42,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:45:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:45:42,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:45:42,323 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 5 states. [2018-11-23 14:45:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:42,445 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-11-23 14:45:42,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 14:45:42,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 14:45:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:42,446 INFO L225 Difference]: With dead ends: 129 [2018-11-23 14:45:42,446 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 14:45:42,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 14:45:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 14:45:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-11-23 14:45:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 14:45:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-11-23 14:45:42,449 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 28 [2018-11-23 14:45:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:42,449 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-11-23 14:45:42,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:45:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-11-23 14:45:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 14:45:42,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:42,449 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:42,450 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:42,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:42,450 INFO L82 PathProgramCache]: Analyzing trace with hash 899005004, now seen corresponding path program 1 times [2018-11-23 14:45:42,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:42,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:42,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:42,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:42,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:42,590 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 14:45:42,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:42,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 14:45:42,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 14:45:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 14:45:42,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-23 14:45:42,591 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 12 states. [2018-11-23 14:45:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:42,940 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-11-23 14:45:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:45:42,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-23 14:45:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:42,941 INFO L225 Difference]: With dead ends: 117 [2018-11-23 14:45:42,941 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 14:45:42,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-23 14:45:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 14:45:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-11-23 14:45:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 14:45:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-11-23 14:45:42,944 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 30 [2018-11-23 14:45:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:42,944 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-11-23 14:45:42,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 14:45:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-11-23 14:45:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 14:45:42,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:42,945 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:42,945 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:42,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash 899005005, now seen corresponding path program 1 times [2018-11-23 14:45:42,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:42,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:42,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:42,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:42,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:43,122 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 14:45:43,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:43,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 14:45:43,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 14:45:43,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 14:45:43,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-23 14:45:43,123 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 13 states. [2018-11-23 14:45:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:43,489 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-11-23 14:45:43,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 14:45:43,489 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-23 14:45:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:43,490 INFO L225 Difference]: With dead ends: 114 [2018-11-23 14:45:43,490 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 14:45:43,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2018-11-23 14:45:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 14:45:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2018-11-23 14:45:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 14:45:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-11-23 14:45:43,492 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 30 [2018-11-23 14:45:43,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:43,493 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-11-23 14:45:43,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 14:45:43,493 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-11-23 14:45:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 14:45:43,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:43,493 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] [2018-11-23 14:45:43,494 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:43,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash 460881481, now seen corresponding path program 1 times [2018-11-23 14:45:43,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:43,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:43,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:43,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:43,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:43,626 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 14:45:43,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:45:43,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 14:45:43,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:43,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:45:43,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:43,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:43,765 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 14:45:43,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:43,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:43,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-11-23 14:45:43,802 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 14:45:43,812 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 14:45:43,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:43,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:43,823 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 14:45:43,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-11-23 14:45:43,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:43,877 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 39 treesize of output 43 [2018-11-23 14:45:43,881 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 14:45:43,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:43,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:43,898 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 14:45:43,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-11-23 14:45:43,974 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 49 treesize of output 44 [2018-11-23 14:45:43,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 14:45:43,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:43,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:44,012 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 14:45:44,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:84 [2018-11-23 14:45:44,050 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 14:45:44,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:44,054 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 14:45:44,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:44,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:44,064 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 14:45:44,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-11-23 14:45:44,119 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 14:45:44,125 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 14:45:44,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:44,130 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 14:45:44,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:44,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:44,137 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 14:45:44,137 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-11-23 14:45:44,185 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 14:45:44,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:45:44,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2018-11-23 14:45:44,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 14:45:44,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 14:45:44,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-11-23 14:45:44,208 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 24 states. [2018-11-23 14:45:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:44,953 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2018-11-23 14:45:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 14:45:44,953 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2018-11-23 14:45:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:44,954 INFO L225 Difference]: With dead ends: 195 [2018-11-23 14:45:44,954 INFO L226 Difference]: Without dead ends: 195 [2018-11-23 14:45:44,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=313, Invalid=1092, Unknown=1, NotChecked=0, Total=1406 [2018-11-23 14:45:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-23 14:45:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 132. [2018-11-23 14:45:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 14:45:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2018-11-23 14:45:44,958 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 40 [2018-11-23 14:45:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:44,959 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2018-11-23 14:45:44,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 14:45:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2018-11-23 14:45:44,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 14:45:44,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:44,960 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] [2018-11-23 14:45:44,960 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:44,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:44,960 INFO L82 PathProgramCache]: Analyzing trace with hash 460881482, now seen corresponding path program 1 times [2018-11-23 14:45:44,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:44,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:44,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:44,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:44,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:45,125 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 14:45:45,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:45:45,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 14:45:45,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:45,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:45:45,165 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 14:45:45,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:45,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:45,174 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 14:45:45,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-23 14:45:45,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:45:45,191 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 14:45:45,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:45:45,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 14:45:45,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,210 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 14:45:45,210 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-23 14:45:45,238 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 29 treesize of output 30 [2018-11-23 14:45:45,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 14:45:45,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,269 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 52 treesize of output 48 [2018-11-23 14:45:45,271 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 14:45:45,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,283 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 14:45:45,283 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-11-23 14:45:45,352 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 32 treesize of output 38 [2018-11-23 14:45:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-23 14:45:45,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:45,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:45,394 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 72 treesize of output 67 [2018-11-23 14:45:45,397 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 16 treesize of output 13 [2018-11-23 14:45:45,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,413 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 80 treesize of output 75 [2018-11-23 14:45:45,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 14:45:45,423 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:45,440 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:45,467 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 2 xjuncts. [2018-11-23 14:45:45,467 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:123 [2018-11-23 14:45:45,517 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 14:45:45,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:45,521 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 14:45:45,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,542 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 14:45:45,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:45,546 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 14:45:45,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,557 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 14:45:45,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2018-11-23 14:45:45,607 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 14:45:45,610 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 14:45:45,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,617 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 14:45:45,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,647 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 14:45:45,648 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 14:45:45,649 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,654 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 14:45:45,654 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:45,660 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 14:45:45,660 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-11-23 14:45:45,666 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 14:45:45,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:45:45,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2018-11-23 14:45:45,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 14:45:45,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 14:45:45,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-23 14:45:45,692 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 20 states. [2018-11-23 14:45:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:46,600 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2018-11-23 14:45:46,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 14:45:46,600 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-11-23 14:45:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:46,601 INFO L225 Difference]: With dead ends: 192 [2018-11-23 14:45:46,601 INFO L226 Difference]: Without dead ends: 192 [2018-11-23 14:45:46,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=928, Unknown=3, NotChecked=0, Total=1122 [2018-11-23 14:45:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-23 14:45:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 134. [2018-11-23 14:45:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 14:45:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-11-23 14:45:46,605 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 40 [2018-11-23 14:45:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:46,605 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-11-23 14:45:46,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 14:45:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-11-23 14:45:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 14:45:46,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:46,606 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] [2018-11-23 14:45:46,606 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:46,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1824860725, now seen corresponding path program 1 times [2018-11-23 14:45:46,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:46,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:46,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:46,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:46,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:46,936 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 14:45:46,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:45:46,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 14:45:46,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:46,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:45:47,030 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 14:45:47,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:47,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:47,042 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 14:45:47,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-23 14:45:47,094 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 14:45:47,096 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 14:45:47,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,121 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 14:45:47,126 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 14:45:47,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,138 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 14:45:47,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-23 14:45:47,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:47,182 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 64 [2018-11-23 14:45:47,184 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 14:45:47,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:47,204 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 29 treesize of output 30 [2018-11-23 14:45:47,206 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 14:45:47,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,217 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 14:45:47,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-11-23 14:45:47,309 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 62 treesize of output 57 [2018-11-23 14:45:47,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 14:45:47,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:47,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:47,386 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 72 treesize of output 77 [2018-11-23 14:45:47,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-23 14:45:47,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:47,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:47,425 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 68 treesize of output 67 [2018-11-23 14:45:47,428 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 20 treesize of output 17 [2018-11-23 14:45:47,429 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,436 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,462 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 2 xjuncts. [2018-11-23 14:45:47,462 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:83, output treesize:135 [2018-11-23 14:45:47,516 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 14:45:47,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,540 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 14:45:47,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:47,545 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 14:45:47,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,553 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,568 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 14:45:47,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:47,571 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 14:45:47,572 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,588 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 14:45:47,590 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 14:45:47,590 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,591 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,598 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 14:45:47,598 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2018-11-23 14:45:47,673 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 14:45:47,676 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 14:45:47,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,681 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 14:45:47,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,694 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 14:45:47,696 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 14:45:47,696 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,703 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 14:45:47,703 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,705 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:47,710 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 14:45:47,710 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-11-23 14:45:47,771 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 14:45:47,775 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 14:45:47,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:47,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:47,783 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 14:45:47,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-11-23 14:45:47,838 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 14:45:47,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:45:47,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 35 [2018-11-23 14:45:47,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 14:45:47,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 14:45:47,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1095, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 14:45:47,855 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 35 states. [2018-11-23 14:45:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:49,618 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2018-11-23 14:45:49,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 14:45:49,619 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2018-11-23 14:45:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:49,619 INFO L225 Difference]: With dead ends: 197 [2018-11-23 14:45:49,619 INFO L226 Difference]: Without dead ends: 196 [2018-11-23 14:45:49,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=394, Invalid=2683, Unknown=3, NotChecked=0, Total=3080 [2018-11-23 14:45:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-23 14:45:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 131. [2018-11-23 14:45:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 14:45:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-11-23 14:45:49,622 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 44 [2018-11-23 14:45:49,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:49,623 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-11-23 14:45:49,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 14:45:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-11-23 14:45:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 14:45:49,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:49,623 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, 1, 1, 1, 1] [2018-11-23 14:45:49,624 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:49,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1475687244, now seen corresponding path program 1 times [2018-11-23 14:45:49,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:49,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:49,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:49,663 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 14:45:49,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:45:49,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 14:45:49,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 14:45:49,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:45:49,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:45:49,664 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 6 states. [2018-11-23 14:45:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:49,761 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-23 14:45:49,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:45:49,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 14:45:49,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:49,762 INFO L225 Difference]: With dead ends: 101 [2018-11-23 14:45:49,762 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 14:45:49,762 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 14:45:49,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 14:45:49,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-11-23 14:45:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 14:45:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-11-23 14:45:49,765 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 47 [2018-11-23 14:45:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:49,765 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-11-23 14:45:49,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 14:45:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-11-23 14:45:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 14:45:49,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:49,766 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, 1, 1, 1, 1] [2018-11-23 14:45:49,766 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:49,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash 130593269, now seen corresponding path program 2 times [2018-11-23 14:45:49,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:49,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:49,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:49,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:49,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:45:50,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:45:50,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 14:45:50,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 14:45:50,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 14:45:50,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 14:45:50,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:45:50,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:50,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:50,119 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 14:45:50,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-23 14:45:50,154 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 14:45:50,157 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 14:45:50,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,178 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 14:45:50,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-11-23 14:45:50,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:50,228 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 30 treesize of output 34 [2018-11-23 14:45:50,231 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 14:45:50,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,242 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 14:45:50,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-11-23 14:45:50,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:50,337 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 14:45:50,339 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 14:45:50,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,358 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 55 treesize of output 50 [2018-11-23 14:45:50,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-11-23 14:45:50,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:50,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:50,393 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 2 xjuncts. [2018-11-23 14:45:50,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:114 [2018-11-23 14:45:50,434 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 109 treesize of output 104 [2018-11-23 14:45:50,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:50,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 42 treesize of output 30 [2018-11-23 14:45:50,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,453 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 78 treesize of output 68 [2018-11-23 14:45:50,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:50,456 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 14:45:50,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:120, output treesize:42 [2018-11-23 14:45:50,620 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:45:50,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-11-23 14:45:50,626 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:45:50,626 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 19 treesize of output 15 [2018-11-23 14:45:50,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,634 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:45:50,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-11-23 14:45:50,635 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 14:45:50,642 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 14:45:50,651 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 23 treesize of output 19 [2018-11-23 14:45:50,652 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:45:50,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-23 14:45:50,653 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:45:50,658 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 14:45:50,658 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,659 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:50,664 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 14:45:50,664 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-11-23 14:45:50,671 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 14:45:50,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:45:50,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 31 [2018-11-23 14:45:50,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 14:45:50,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 14:45:50,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=822, Unknown=1, NotChecked=0, Total=930 [2018-11-23 14:45:50,687 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 31 states. [2018-11-23 14:45:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:51,678 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-11-23 14:45:51,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 14:45:51,678 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 48 [2018-11-23 14:45:51,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:51,678 INFO L225 Difference]: With dead ends: 114 [2018-11-23 14:45:51,678 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 14:45:51,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=297, Invalid=1772, Unknown=1, NotChecked=0, Total=2070 [2018-11-23 14:45:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 14:45:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 80. [2018-11-23 14:45:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 14:45:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-23 14:45:51,681 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 48 [2018-11-23 14:45:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:51,681 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-23 14:45:51,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 14:45:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-23 14:45:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 14:45:51,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:51,682 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:51,682 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:51,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:51,682 INFO L82 PathProgramCache]: Analyzing trace with hash 78663807, now seen corresponding path program 1 times [2018-11-23 14:45:51,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:51,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:51,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:51,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:45:51,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:51,912 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 14:45:51,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:45:51,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 14:45:51,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:51,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:45:51,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:51,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:51,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 14:45:51,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:51,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:51,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-23 14:45:51,957 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 14:45:51,959 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 14:45:51,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:51,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:51,965 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 14:45:51,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-23 14:45:51,980 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 30 treesize of output 26 [2018-11-23 14:45:51,982 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 14:45:51,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:51,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,003 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 14:45:52,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-11-23 14:45:52,066 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 40 treesize of output 35 [2018-11-23 14:45:52,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 14:45:52,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:52,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:52,096 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 14:45:52,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:76 [2018-11-23 14:45:52,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:52,132 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 14:45:52,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:52,135 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 14:45:52,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-11-23 14:45:52,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:52,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:52,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:52,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:52,153 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 16 treesize of output 13 [2018-11-23 14:45:52,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2018-11-23 14:45:52,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:52,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 14:45:52,188 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 14:45:52,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,197 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 14:45:52,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37 [2018-11-23 14:45:52,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:52,240 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 53 treesize of output 53 [2018-11-23 14:45:52,242 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 14 treesize of output 13 [2018-11-23 14:45:52,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,257 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 14:45:52,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-11-23 14:45:52,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2018-11-23 14:45:52,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 14:45:52,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:52,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:52,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 14:45:52,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:126 [2018-11-23 14:45:52,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 77 [2018-11-23 14:45:52,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:52,444 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 14:45:52,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 14:45:52,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:61 [2018-11-23 14:45:52,521 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 68 treesize of output 43 [2018-11-23 14:45:52,524 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 27 treesize of output 16 [2018-11-23 14:45:52,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,531 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 14:45:52,531 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,537 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 13 treesize of output 9 [2018-11-23 14:45:52,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:52,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:5 [2018-11-23 14:45:52,562 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 14:45:52,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:45:52,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 32 [2018-11-23 14:45:52,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 14:45:52,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 14:45:52,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 14:45:52,579 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 33 states. [2018-11-23 14:45:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:53,676 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-11-23 14:45:53,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 14:45:53,676 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-11-23 14:45:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:53,677 INFO L225 Difference]: With dead ends: 146 [2018-11-23 14:45:53,677 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 14:45:53,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=424, Invalid=2650, Unknown=6, NotChecked=0, Total=3080 [2018-11-23 14:45:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 14:45:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2018-11-23 14:45:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 14:45:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-11-23 14:45:53,680 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 49 [2018-11-23 14:45:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:53,680 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-11-23 14:45:53,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 14:45:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-11-23 14:45:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 14:45:53,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:53,681 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:53,682 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:53,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash 78663808, now seen corresponding path program 1 times [2018-11-23 14:45:53,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:53,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:53,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:54,053 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 14:45:54,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:45:54,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 14:45:54,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:54,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:45:54,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,128 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 14:45:54,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-23 14:45:54,152 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 14:45:54,154 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 14:45:54,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,165 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 14:45:54,168 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 14:45:54,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,177 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 14:45:54,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-11-23 14:45:54,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,233 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 29 treesize of output 30 [2018-11-23 14:45:54,234 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 14:45:54,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,249 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 43 treesize of output 47 [2018-11-23 14:45:54,251 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 14:45:54,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,262 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 14:45:54,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-11-23 14:45:54,346 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 53 treesize of output 44 [2018-11-23 14:45:54,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 14:45:54,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:54,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:54,392 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 63 treesize of output 68 [2018-11-23 14:45:54,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-23 14:45:54,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:54,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:54,417 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 59 treesize of output 58 [2018-11-23 14:45:54,419 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 20 treesize of output 17 [2018-11-23 14:45:54,419 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,426 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,450 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 2 xjuncts. [2018-11-23 14:45:54,450 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:137 [2018-11-23 14:45:54,506 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 14:45:54,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,509 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 14:45:54,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,534 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 53 treesize of output 52 [2018-11-23 14:45:54,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,545 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 14:45:54,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,564 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:61 [2018-11-23 14:45:54,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,599 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 14:45:54,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,616 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 16 treesize of output 13 [2018-11-23 14:45:54,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-11-23 14:45:54,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-11-23 14:45:54,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14:45:54,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,705 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 14:45:54,708 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 14:45:54,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,726 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 14:45:54,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:62 [2018-11-23 14:45:54,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:54,799 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 94 treesize of output 94 [2018-11-23 14:45:54,801 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 14 treesize of output 13 [2018-11-23 14:45:54,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,833 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 29 treesize of output 30 [2018-11-23 14:45:54,835 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 14:45:54,835 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:54,852 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 14:45:54,853 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-11-23 14:45:55,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107 [2018-11-23 14:45:55,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 14:45:55,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:55,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:55,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 118 [2018-11-23 14:45:55,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-11-23 14:45:55,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:55,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:55,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 110 [2018-11-23 14:45:55,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21 [2018-11-23 14:45:55,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:55,179 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:55,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 14:45:55,222 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:142, output treesize:223 [2018-11-23 14:45:55,318 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 14:45:55,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:55,323 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 14:45:55,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:55,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:55,391 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 14:45:55,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:55,395 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 14:45:55,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:55,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:55,409 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 14:45:55,409 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:101 [2018-11-23 14:45:55,524 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 14:45:55,527 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 14:45:55,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:55,547 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 14:45:55,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:55,563 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 14:45:55,564 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 14:45:55,575 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 14:45:55,592 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 14:45:55,594 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 14:45:55,594 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:55,600 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 14:45:55,600 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:55,603 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:55,614 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 14:45:55,614 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-11-23 14:45:55,701 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 14:45:55,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:45:55,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2018-11-23 14:45:55,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 14:45:55,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 14:45:55,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 14:45:55,718 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 39 states. [2018-11-23 14:45:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:45:58,124 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-11-23 14:45:58,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 14:45:58,126 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 49 [2018-11-23 14:45:58,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:45:58,126 INFO L225 Difference]: With dead ends: 148 [2018-11-23 14:45:58,127 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 14:45:58,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=463, Invalid=3696, Unknown=1, NotChecked=0, Total=4160 [2018-11-23 14:45:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 14:45:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 110. [2018-11-23 14:45:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 14:45:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-11-23 14:45:58,130 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 49 [2018-11-23 14:45:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:45:58,130 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-11-23 14:45:58,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 14:45:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-11-23 14:45:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 14:45:58,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:45:58,131 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:45:58,131 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:45:58,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:45:58,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1362125989, now seen corresponding path program 3 times [2018-11-23 14:45:58,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:45:58,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:45:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:58,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:45:58,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:45:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:45:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:45:58,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:45:58,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 14:45:58,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 14:45:58,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 14:45:58,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 14:45:58,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:45:58,497 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 14:45:58,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 14:45:58,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:58,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:58,532 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 14:45:58,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-23 14:45:58,551 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 14:45:58,553 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 14:45:58,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,560 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 14:45:58,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-11-23 14:45:58,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:58,606 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 30 treesize of output 34 [2018-11-23 14:45:58,608 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 14:45:58,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,618 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 14:45:58,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-11-23 14:45:58,700 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 40 treesize of output 35 [2018-11-23 14:45:58,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 14:45:58,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:58,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:58,729 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 14:45:58,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:82 [2018-11-23 14:45:58,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:58,771 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 14:45:58,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:58,774 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 14:45:58,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2018-11-23 14:45:58,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:58,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:58,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:58,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:58,788 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 16 treesize of output 13 [2018-11-23 14:45:58,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2018-11-23 14:45:58,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:58,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 14:45:58,821 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 14:45:58,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,831 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 14:45:58,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-11-23 14:45:58,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:58,880 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 53 treesize of output 53 [2018-11-23 14:45:58,881 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 14 treesize of output 13 [2018-11-23 14:45:58,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:58,894 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 14:45:58,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-11-23 14:45:58,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2018-11-23 14:45:59,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 14:45:59,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:45:59,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:45:59,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 14:45:59,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:132 [2018-11-23 14:45:59,110 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 104 treesize of output 77 [2018-11-23 14:45:59,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:45:59,114 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 14:45:59,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:59,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:59,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 14:45:59,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:64 [2018-11-23 14:45:59,261 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 68 treesize of output 43 [2018-11-23 14:45:59,263 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 27 treesize of output 16 [2018-11-23 14:45:59,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:59,268 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 14:45:59,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:59,273 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 13 treesize of output 9 [2018-11-23 14:45:59,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:45:59,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:59,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:45:59,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:5 [2018-11-23 14:45:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:45:59,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:45:59,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2018-11-23 14:45:59,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 14:45:59,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 14:45:59,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 14:45:59,313 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 39 states. [2018-11-23 14:46:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:46:00,819 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2018-11-23 14:46:00,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 14:46:00,819 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-11-23 14:46:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:46:00,819 INFO L225 Difference]: With dead ends: 183 [2018-11-23 14:46:00,819 INFO L226 Difference]: Without dead ends: 183 [2018-11-23 14:46:00,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=527, Invalid=3504, Unknown=1, NotChecked=0, Total=4032 [2018-11-23 14:46:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-23 14:46:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 138. [2018-11-23 14:46:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 14:46:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2018-11-23 14:46:00,823 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 52 [2018-11-23 14:46:00,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:46:00,823 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2018-11-23 14:46:00,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 14:46:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2018-11-23 14:46:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 14:46:00,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:46:00,824 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:46:00,824 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:46:00,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:46:00,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1362125988, now seen corresponding path program 2 times [2018-11-23 14:46:00,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:46:00,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:46:00,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:46:00,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:46:00,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:46:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:01,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:46:01,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 14:46:01,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 14:46:01,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 14:46:01,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 14:46:01,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:46:01,223 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 14:46:01,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 14:46:01,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,263 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 14:46:01,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-23 14:46:01,299 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 14:46:01,301 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 14:46:01,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,312 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 14:46:01,313 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 14:46:01,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,322 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 14:46:01,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-23 14:46:01,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,376 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 64 [2018-11-23 14:46:01,380 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 14:46:01,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,400 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 29 treesize of output 30 [2018-11-23 14:46:01,402 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 14:46:01,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,414 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 14:46:01,414 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2018-11-23 14:46:01,535 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 32 treesize of output 38 [2018-11-23 14:46:01,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-23 14:46:01,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:01,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:01,590 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 80 treesize of output 75 [2018-11-23 14:46:01,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 14:46:01,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:01,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:01,622 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 72 treesize of output 67 [2018-11-23 14:46:01,625 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 16 treesize of output 13 [2018-11-23 14:46:01,626 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,635 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,668 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 2 xjuncts. [2018-11-23 14:46:01,668 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:91, output treesize:145 [2018-11-23 14:46:01,737 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 14:46:01,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,740 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 14:46:01,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,764 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 14:46:01,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,767 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 14:46:01,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:68 [2018-11-23 14:46:01,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,823 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 14:46:01,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,840 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 14:46:01,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:75 [2018-11-23 14:46:01,892 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 14:46:01,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 14:46:01,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:01,918 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 14:46:01,920 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 14:46:01,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:01,948 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 14:46:01,948 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2018-11-23 14:46:02,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:02,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 106 [2018-11-23 14:46:02,022 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 14 treesize of output 13 [2018-11-23 14:46:02,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,050 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 29 treesize of output 30 [2018-11-23 14:46:02,051 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 14:46:02,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,067 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 14:46:02,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:111, output treesize:95 [2018-11-23 14:46:02,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107 [2018-11-23 14:46:02,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 14:46:02,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:02,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:02,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 110 [2018-11-23 14:46:02,270 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 24 treesize of output 21 [2018-11-23 14:46:02,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 118 [2018-11-23 14:46:02,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-11-23 14:46:02,295 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:02,314 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:02,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 14:46:02,354 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:148, output treesize:235 [2018-11-23 14:46:02,453 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 14:46:02,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:02,457 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 14:46:02,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,487 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 14:46:02,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:02,491 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 14:46:02,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,507 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 14:46:02,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:193, output treesize:107 [2018-11-23 14:46:02,611 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 14:46:02,613 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 31 treesize of output 23 [2018-11-23 14:46:02,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:46:02,625 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 14:46:02,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,634 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 27 treesize of output 16 [2018-11-23 14:46:02,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,640 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 14:46:02,652 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 14:46:02,654 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 14:46:02,654 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,658 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 14:46:02,658 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,659 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:02,667 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 14:46:02,667 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:121, output treesize:18 [2018-11-23 14:46:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:02,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:46:02,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 40 [2018-11-23 14:46:02,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 14:46:02,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 14:46:02,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1501, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 14:46:02,763 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand 41 states. [2018-11-23 14:46:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:46:05,506 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2018-11-23 14:46:05,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 14:46:05,506 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 52 [2018-11-23 14:46:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:46:05,507 INFO L225 Difference]: With dead ends: 188 [2018-11-23 14:46:05,507 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 14:46:05,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=521, Invalid=4034, Unknown=1, NotChecked=0, Total=4556 [2018-11-23 14:46:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 14:46:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 120. [2018-11-23 14:46:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 14:46:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-11-23 14:46:05,510 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 52 [2018-11-23 14:46:05,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:46:05,510 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-11-23 14:46:05,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 14:46:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-11-23 14:46:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 14:46:05,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:46:05,511 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, 1, 1, 1, 1, 1] [2018-11-23 14:46:05,511 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:46:05,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:46:05,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1691181823, now seen corresponding path program 1 times [2018-11-23 14:46:05,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:46:05,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:46:05,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:46:05,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:46:05,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:46:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:05,837 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 14:46:05,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:46:05,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 14:46:05,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:46:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:05,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:46:05,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:05,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:05,875 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 14:46:05,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:05,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:05,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-23 14:46:05,882 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 14:46:05,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 14:46:05,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:05,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:05,893 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 14:46:05,894 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 14:46:05,895 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:05,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:05,901 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 14:46:05,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20 [2018-11-23 14:46:05,911 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 14:46:05,913 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 14:46:05,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:05,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:05,924 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 43 treesize of output 39 [2018-11-23 14:46:05,926 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 14:46:05,926 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:05,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:05,935 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 14:46:05,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2018-11-23 14:46:06,015 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 32 treesize of output 38 [2018-11-23 14:46:06,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 2 case distinctions, treesize of input 20 treesize of output 39 [2018-11-23 14:46:06,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:06,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:06,066 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 75 treesize of output 70 [2018-11-23 14:46:06,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-11-23 14:46:06,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:06,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:06,092 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 71 treesize of output 66 [2018-11-23 14:46:06,094 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:46:06,095 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 16 treesize of output 17 [2018-11-23 14:46:06,095 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,128 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 2 xjuncts. [2018-11-23 14:46:06,129 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:141 [2018-11-23 14:46:06,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,186 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 61 treesize of output 60 [2018-11-23 14:46:06,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,191 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 14:46:06,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,213 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 53 treesize of output 59 [2018-11-23 14:46:06,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,216 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 14:46:06,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2018-11-23 14:46:06,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,236 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 22 treesize of output 42 [2018-11-23 14:46:06,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:76 [2018-11-23 14:46:06,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 14:46:06,309 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 19 [2018-11-23 14:46:06,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,339 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 45 treesize of output 51 [2018-11-23 14:46:06,341 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 23 [2018-11-23 14:46:06,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,348 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,360 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 14:46:06,360 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:74 [2018-11-23 14:46:06,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,444 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 66 treesize of output 67 [2018-11-23 14:46:06,446 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 14:46:06,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,480 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 96 treesize of output 112 [2018-11-23 14:46:06,482 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 14 treesize of output 13 [2018-11-23 14:46:06,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,508 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 14:46:06,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:96 [2018-11-23 14:46:06,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 117 [2018-11-23 14:46:06,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 14:46:06,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:06,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:06,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 120 [2018-11-23 14:46:06,752 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 20 treesize of output 13 [2018-11-23 14:46:06,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 128 [2018-11-23 14:46:06,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 14:46:06,779 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:06,796 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:06,829 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 2 xjuncts. [2018-11-23 14:46:06,829 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:163, output treesize:213 [2018-11-23 14:46:06,895 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 202 treesize of output 176 [2018-11-23 14:46:06,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,899 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 14:46:06,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,927 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 164 treesize of output 121 [2018-11-23 14:46:06,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:06,930 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 14:46:06,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:06,948 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 14:46:06,948 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:224, output treesize:114 [2018-11-23 14:46:07,034 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 99 treesize of output 88 [2018-11-23 14:46:07,035 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 70 treesize of output 57 [2018-11-23 14:46:07,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:07,043 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 14:46:07,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:07,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:07,056 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 14:46:07,057 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:128, output treesize:86 [2018-11-23 14:46:07,168 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 14:46:07,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 14:46:07,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:07,176 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 14:46:07,176 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 14:46:07,182 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 14:46:07,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:07,187 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 14:46:07,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 14:46:07,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:28 [2018-11-23 14:46:07,262 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 14:46:07,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:46:07,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 37 [2018-11-23 14:46:07,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 14:46:07,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 14:46:07,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 14:46:07,278 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 38 states. [2018-11-23 14:46:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:46:08,728 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-11-23 14:46:08,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 14:46:08,728 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 53 [2018-11-23 14:46:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:46:08,728 INFO L225 Difference]: With dead ends: 182 [2018-11-23 14:46:08,728 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 14:46:08,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=473, Invalid=3187, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 14:46:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 14:46:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2018-11-23 14:46:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 14:46:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-11-23 14:46:08,731 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 53 [2018-11-23 14:46:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:46:08,731 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-11-23 14:46:08,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 14:46:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-11-23 14:46:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 14:46:08,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:46:08,731 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, 1, 1, 1, 1, 1] [2018-11-23 14:46:08,731 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:46:08,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:46:08,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1691181822, now seen corresponding path program 1 times [2018-11-23 14:46:08,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:46:08,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:46:08,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:46:08,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:46:08,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:46:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:09,086 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 14:46:09,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:46:09,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/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 14:46:09,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:46:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:09,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:46:09,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,122 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 14:46:09,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-23 14:46:09,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14:46:09,132 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 14:46:09,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,141 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 14:46:09,142 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 14:46:09,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,149 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 14:46:09,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20 [2018-11-23 14:46:09,160 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 51 treesize of output 47 [2018-11-23 14:46:09,162 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 14:46:09,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,174 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 14:46:09,176 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 14:46:09,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,183 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 14:46:09,183 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2018-11-23 14:46:09,269 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 53 treesize of output 44 [2018-11-23 14:46:09,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-11-23 14:46:09,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:09,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:09,312 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 67 treesize of output 78 [2018-11-23 14:46:09,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 51 [2018-11-23 14:46:09,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:09,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:09,337 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 67 treesize of output 66 [2018-11-23 14:46:09,339 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:46:09,340 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 20 treesize of output 21 [2018-11-23 14:46:09,340 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,348 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,372 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 2 xjuncts. [2018-11-23 14:46:09,372 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:159 [2018-11-23 14:46:09,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,425 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 61 treesize of output 60 [2018-11-23 14:46:09,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,428 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 14:46:09,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,470 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 53 treesize of output 59 [2018-11-23 14:46:09,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,473 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 14:46:09,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,486 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2018-11-23 14:46:09,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,490 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 16 treesize of output 13 [2018-11-23 14:46:09,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,502 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 14:46:09,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-11-23 14:46:09,542 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:46:09,551 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 45 treesize of output 56 [2018-11-23 14:46:09,553 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 23 [2018-11-23 14:46:09,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-23 14:46:09,574 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 19 [2018-11-23 14:46:09,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,588 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 14:46:09,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:75 [2018-11-23 14:46:09,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,650 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 81 treesize of output 102 [2018-11-23 14:46:09,652 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 14:46:09,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:09,683 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 102 treesize of output 118 [2018-11-23 14:46:09,685 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 14 treesize of output 13 [2018-11-23 14:46:09,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,706 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 14:46:09,706 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:117, output treesize:97 [2018-11-23 14:46:09,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 135 [2018-11-23 14:46:09,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 14:46:09,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:09,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:09,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 109 [2018-11-23 14:46:09,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 14:46:09,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 14:46:09,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:46:09,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 99 [2018-11-23 14:46:09,926 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 20 treesize of output 13 [2018-11-23 14:46:09,926 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,936 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:09,966 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 2 xjuncts. [2018-11-23 14:46:09,967 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:164, output treesize:193 [2018-11-23 14:46:10,033 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 225 treesize of output 170 [2018-11-23 14:46:10,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:10,036 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 14:46:10,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:10,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:10,065 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 162 treesize of output 144 [2018-11-23 14:46:10,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:46:10,068 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 14:46:10,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:10,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:10,085 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 14:46:10,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:225, output treesize:115 [2018-11-23 14:46:10,268 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 14:46:10,270 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 45 treesize of output 37 [2018-11-23 14:46:10,271 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:46:10,280 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 14:46:10,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:10,290 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 54 treesize of output 21 [2018-11-23 14:46:10,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:10,297 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 14:46:10,306 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 30 treesize of output 32 [2018-11-23 14:46:10,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 15 treesize of output 3 [2018-11-23 14:46:10,308 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:10,315 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 14:46:10,315 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 14:46:10,316 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:46:10,320 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 14:46:10,320 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2018-11-23 14:46:10,339 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 14:46:10,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:46:10,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 35 [2018-11-23 14:46:10,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 14:46:10,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 14:46:10,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 14:46:10,355 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 36 states. [2018-11-23 14:46:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:46:11,621 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2018-11-23 14:46:11,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 14:46:11,621 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2018-11-23 14:46:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:46:11,621 INFO L225 Difference]: With dead ends: 177 [2018-11-23 14:46:11,621 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 14:46:11,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=320, Invalid=2870, Unknown=2, NotChecked=0, Total=3192 [2018-11-23 14:46:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 14:46:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 142. [2018-11-23 14:46:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 14:46:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-11-23 14:46:11,623 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 53 [2018-11-23 14:46:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:46:11,624 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-11-23 14:46:11,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 14:46:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-11-23 14:46:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 14:46:11,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:46:11,624 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:46:11,624 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr4REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION]=== [2018-11-23 14:46:11,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:46:11,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1728090713, now seen corresponding path program 1 times [2018-11-23 14:46:11,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:46:11,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:46:11,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:46:11,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:46:11,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:46:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:46:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:46:11,679 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=22, |#NULL.offset|=13, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] RET #213#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret19 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L995 VAL [main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L995-1 VAL [main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L996 VAL [main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |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(12); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |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=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |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=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~mem3.base|=31, |main_#t~mem3.offset|=0] [?] SUMMARY for call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1006 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~mem3.base|=31, |main_#t~mem3.offset|=0] [?] havoc #t~mem3.base, #t~mem3.offset; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1007 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~mem4.base|=31, |main_#t~mem4.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1008 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~nondet5|=0] [?] assume !(0 != #t~nondet5);havoc #t~nondet5; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1016 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0] [?] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12); VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1017 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1017-1 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem7.base|=30, |main_#t~mem7.offset|=0] [?] SUMMARY for call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, 4 + #t~mem7.offset, 4); srcloc: L1018 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem7.base|=30, |main_#t~mem7.offset|=0] [?] havoc #t~mem7.base, #t~mem7.offset; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1019 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem8.base|=30, |main_#t~mem8.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1020 VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020-1 VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.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=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1030-3 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem9|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1034 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem10|=1] [?] assume !(~unnamed1~0~RED == #t~mem10);havoc #t~mem10; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1040-3 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem13.base|=31, |main_#t~mem13.offset|=0] [?] assume !(#t~mem13.base == 0 && #t~mem13.offset == 0);havoc #t~mem13.base, #t~mem13.offset; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1040-4 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem14.base|=31, |main_#t~mem14.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1034 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem10|=0] [?] assume ~unnamed1~0~RED == #t~mem10;havoc #t~mem10; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1036 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem11.base|=30, |main_#t~mem11.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1037 VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem12.base|=0, |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=0, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] assume !(1 == #valid[~end~0.base]); VAL [main_~end~0.base=0, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=13, old(#NULL.base)=22, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L994] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L995] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L996] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~nondet1=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002-L1023] assume !!(0 != #t~nondet1); [L1002] havoc #t~nondet1; [L1005] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem3.base=31, #t~mem3.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1006] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem3.base=31, #t~mem3.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1006] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1007] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem4.base=31, #t~mem4.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1007] ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; [L1007] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1008] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1010] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~nondet5=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1010-L1022] assume !(0 != #t~nondet5); [L1010] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1016] call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1017] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1017] call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem7.base=30, #t~mem7.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem7.base=30, #t~mem7.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] havoc #t~mem7.base, #t~mem7.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1019] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem8.base=30, #t~mem8.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1019] ~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset; [L1019] havoc #t~mem8.base, #t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1020] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1021] call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~nondet1=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002-L1023] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1025] ~end~0.base, ~end~0.offset := 0, 0; [L1026] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1029] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1030] call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem9=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1030] assume !!(~unnamed1~0~BLACK == #t~mem9); [L1030] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem10=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034-L1038] assume !(~unnamed1~0~RED == #t~mem10); [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem13.base=31, #t~mem13.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] assume !(#t~mem13.base == 0 && #t~mem13.offset == 0); [L1040] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1041] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem14.base=31, #t~mem14.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1041] ~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset; [L1041] havoc #t~mem14.base, #t~mem14.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem10=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034-L1038] assume ~unnamed1~0~RED == #t~mem10; [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1036] 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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem11.base=30, #t~mem11.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1036] ~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset; [L1036] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1037] 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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem12.base=0, #t~mem12.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1037] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1037] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=13, old(#NULL.base)=22, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L994] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L995] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L996] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~nondet1=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002-L1023] assume !!(0 != #t~nondet1); [L1002] havoc #t~nondet1; [L1005] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem3.base=31, #t~mem3.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1006] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem3.base=31, #t~mem3.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1006] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1007] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem4.base=31, #t~mem4.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1007] ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; [L1007] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1008] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1010] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~nondet5=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1010-L1022] assume !(0 != #t~nondet5); [L1010] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1016] call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1017] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1017] call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem7.base=30, #t~mem7.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem7.base=30, #t~mem7.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] havoc #t~mem7.base, #t~mem7.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1019] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem8.base=30, #t~mem8.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1019] ~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset; [L1019] havoc #t~mem8.base, #t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1020] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1021] call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~nondet1=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002-L1023] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1025] ~end~0.base, ~end~0.offset := 0, 0; [L1026] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1029] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1030] call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem9=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1030] assume !!(~unnamed1~0~BLACK == #t~mem9); [L1030] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem10=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034-L1038] assume !(~unnamed1~0~RED == #t~mem10); [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem13.base=31, #t~mem13.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] assume !(#t~mem13.base == 0 && #t~mem13.offset == 0); [L1040] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1041] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem14.base=31, #t~mem14.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1041] ~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset; [L1041] havoc #t~mem14.base, #t~mem14.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem10=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034-L1038] assume ~unnamed1~0~RED == #t~mem10; [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1036] 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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem11.base=30, #t~mem11.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1036] ~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset; [L1036] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1037] 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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem12.base=0, #t~mem12.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1037] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1037] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=13, old(#NULL!base)=22, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L995] 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=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~nondet1=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002-L1023] COND FALSE !(!(0 != #t~nondet1)) [L1002] havoc #t~nondet1; [L1005] FCALL call #t~malloc2 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem3!base=31, #t~mem3!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1006] FCALL call write~$Pointer$(~end~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem3!base=31, #t~mem3!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1006] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1007] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem4!base=31, #t~mem4!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1007] ~end~0 := #t~mem4; [L1007] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1008] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1010] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~nondet5=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1010-L1022] COND FALSE !(0 != #t~nondet5) [L1010] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1016] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1017] FCALL call #t~malloc6 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1017] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem7!base=30, #t~mem7!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] FCALL call write~$Pointer$(~end~0, { base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem7!base=30, #t~mem7!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1019] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem8!base=30, #t~mem8!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1019] ~end~0 := #t~mem8; [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1020] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1021] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~nondet1=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem10=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem13!base=31, #t~mem13!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] COND FALSE !(#t~mem13 == { base: 0, offset: 0 }) [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1041] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem14!base=31, #t~mem14!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1041] ~end~0 := #t~mem14; [L1041] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem10=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem10 [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1036] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem11!base=30, #t~mem11!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1036] ~end~0 := #t~mem11; [L1036] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1037] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem12!base=0, #t~mem12!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1037] ~end~0 := #t~mem12; [L1037] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=13, old(#NULL!base)=22, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L995] 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=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~nondet1=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002-L1023] COND FALSE !(!(0 != #t~nondet1)) [L1002] havoc #t~nondet1; [L1005] FCALL call #t~malloc2 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem3!base=31, #t~mem3!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1006] FCALL call write~$Pointer$(~end~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem3!base=31, #t~mem3!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1006] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1007] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem4!base=31, #t~mem4!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1007] ~end~0 := #t~mem4; [L1007] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1008] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1010] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~nondet5=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1010-L1022] COND FALSE !(0 != #t~nondet5) [L1010] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1016] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1017] FCALL call #t~malloc6 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1017] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem7!base=30, #t~mem7!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] FCALL call write~$Pointer$(~end~0, { base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem7!base=30, #t~mem7!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1019] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem8!base=30, #t~mem8!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1019] ~end~0 := #t~mem8; [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1020] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1021] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~nondet1=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem10=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem13!base=31, #t~mem13!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] COND FALSE !(#t~mem13 == { base: 0, offset: 0 }) [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1041] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem14!base=31, #t~mem14!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1041] ~end~0 := #t~mem14; [L1041] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem10=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem10 [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1036] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem11!base=30, #t~mem11!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1036] ~end~0 := #t~mem11; [L1036] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1037] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem12!base=0, #t~mem12!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1037] ~end~0 := #t~mem12; [L1037] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L995] list->next = ((void*)0) VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L996] list->prev = ((void*)0) VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L997] list->colour = BLACK VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L999] SLL* end = list; VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={26:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1006] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1006] end->next->prev = end VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1007] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1007] end = end->next [L1008] end->next = ((void*)0) VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] end->colour = RED VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1017] end->next = malloc(sizeof(SLL)) VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1018] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1018] end->next->prev = end VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1019] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1019] end = end->next [L1020] end->next = ((void*)0) VAL [end={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1021] end->colour = BLACK VAL [end={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1030] EXPR end->colour VAL [end={26:0}, end->colour=1, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] EXPR end->colour VAL [end={26:0}, end->colour=1, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1040] COND FALSE !(!(end->next)) [L1041] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] EXPR end->colour VAL [end={31:0}, end->colour=0, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1036] end = end->next [L1037] EXPR end->next VAL [end={30:0}, end->next={0:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1037] end = end->next [L1040] end->next ----- [2018-11-23 14:46:11,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:46:11 BoogieIcfgContainer [2018-11-23 14:46:11,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:46:11,842 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:46:11,842 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:46:11,843 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:46:11,843 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:45:39" (3/4) ... [2018-11-23 14:46:11,845 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|=22, |#NULL.offset|=13, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] RET #213#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret19 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L995 VAL [main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L995-1 VAL [main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L996 VAL [main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |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(12); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |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=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |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=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~mem3.base|=31, |main_#t~mem3.offset|=0] [?] SUMMARY for call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1006 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~mem3.base|=31, |main_#t~mem3.offset|=0] [?] havoc #t~mem3.base, #t~mem3.offset; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1007 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~mem4.base|=31, |main_#t~mem4.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1008 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~nondet5|=0] [?] assume !(0 != #t~nondet5);havoc #t~nondet5; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1016 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0] [?] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12); VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1017 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1017-1 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem7.base|=30, |main_#t~mem7.offset|=0] [?] SUMMARY for call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, 4 + #t~mem7.offset, 4); srcloc: L1018 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem7.base|=30, |main_#t~mem7.offset|=0] [?] havoc #t~mem7.base, #t~mem7.offset; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1019 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem8.base|=30, |main_#t~mem8.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1020 VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020-1 VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.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=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1030-3 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem9|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1034 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem10|=1] [?] assume !(~unnamed1~0~RED == #t~mem10);havoc #t~mem10; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1040-3 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem13.base|=31, |main_#t~mem13.offset|=0] [?] assume !(#t~mem13.base == 0 && #t~mem13.offset == 0);havoc #t~mem13.base, #t~mem13.offset; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1040-4 VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem14.base|=31, |main_#t~mem14.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1034 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem10|=0] [?] assume ~unnamed1~0~RED == #t~mem10;havoc #t~mem10; VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1036 VAL [main_~end~0.base=31, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem11.base|=30, |main_#t~mem11.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] SUMMARY for call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1037 VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0, |main_#t~mem12.base|=0, |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=0, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] assume !(1 == #valid[~end~0.base]); VAL [main_~end~0.base=0, main_~end~0.offset=0, main_~list~0.base=26, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=26, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=31, |main_#t~malloc2.offset|=0, |main_#t~malloc6.base|=30, |main_#t~malloc6.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=13, old(#NULL.base)=22, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L994] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L995] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L996] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~nondet1=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002-L1023] assume !!(0 != #t~nondet1); [L1002] havoc #t~nondet1; [L1005] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem3.base=31, #t~mem3.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1006] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem3.base=31, #t~mem3.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1006] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1007] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem4.base=31, #t~mem4.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1007] ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; [L1007] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1008] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1010] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~nondet5=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1010-L1022] assume !(0 != #t~nondet5); [L1010] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1016] call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1017] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1017] call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem7.base=30, #t~mem7.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem7.base=30, #t~mem7.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] havoc #t~mem7.base, #t~mem7.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1019] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem8.base=30, #t~mem8.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1019] ~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset; [L1019] havoc #t~mem8.base, #t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1020] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1021] call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~nondet1=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002-L1023] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1025] ~end~0.base, ~end~0.offset := 0, 0; [L1026] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1029] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1030] call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem9=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1030] assume !!(~unnamed1~0~BLACK == #t~mem9); [L1030] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem10=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034-L1038] assume !(~unnamed1~0~RED == #t~mem10); [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem13.base=31, #t~mem13.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] assume !(#t~mem13.base == 0 && #t~mem13.offset == 0); [L1040] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1041] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem14.base=31, #t~mem14.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1041] ~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset; [L1041] havoc #t~mem14.base, #t~mem14.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem10=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034-L1038] assume ~unnamed1~0~RED == #t~mem10; [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1036] 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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem11.base=30, #t~mem11.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1036] ~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset; [L1036] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1037] 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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem12.base=0, #t~mem12.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1037] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1037] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=13, old(#NULL.base)=22, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L994] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L995] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L996] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~nondet1=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002-L1023] assume !!(0 != #t~nondet1); [L1002] havoc #t~nondet1; [L1005] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem3.base=31, #t~mem3.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1006] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem3.base=31, #t~mem3.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1006] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1007] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~mem4.base=31, #t~mem4.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1007] ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; [L1007] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1008] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1010] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~nondet5=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1010-L1022] assume !(0 != #t~nondet5); [L1010] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1016] call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1017] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1017] call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem7.base=30, #t~mem7.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem7.base=30, #t~mem7.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1018] havoc #t~mem7.base, #t~mem7.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1019] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem8.base=30, #t~mem8.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1019] ~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset; [L1019] havoc #t~mem8.base, #t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1020] call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1021] call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~nondet1=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1002-L1023] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1025] ~end~0.base, ~end~0.offset := 0, 0; [L1026] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1029] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1030] call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem9=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1030] assume !!(~unnamed1~0~BLACK == #t~mem9); [L1030] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem10=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034-L1038] assume !(~unnamed1~0~RED == #t~mem10); [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem13.base=31, #t~mem13.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] assume !(#t~mem13.base == 0 && #t~mem13.offset == 0); [L1040] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1041] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem14.base=31, #t~mem14.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1041] ~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset; [L1041] havoc #t~mem14.base, #t~mem14.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem10=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1034-L1038] assume ~unnamed1~0~RED == #t~mem10; [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1036] 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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem11.base=30, #t~mem11.offset=0, ~end~0.base=31, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1036] ~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset; [L1036] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1037] 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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, #t~mem12.base=0, #t~mem12.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1037] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1037] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.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=26, #t~malloc0.offset=0, #t~malloc2.base=31, #t~malloc2.offset=0, #t~malloc6.base=30, #t~malloc6.offset=0, ~end~0.base=0, ~end~0.offset=0, ~list~0.base=26, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=13, old(#NULL!base)=22, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L995] 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=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~nondet1=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002-L1023] COND FALSE !(!(0 != #t~nondet1)) [L1002] havoc #t~nondet1; [L1005] FCALL call #t~malloc2 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem3!base=31, #t~mem3!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1006] FCALL call write~$Pointer$(~end~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem3!base=31, #t~mem3!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1006] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1007] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem4!base=31, #t~mem4!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1007] ~end~0 := #t~mem4; [L1007] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1008] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1010] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~nondet5=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1010-L1022] COND FALSE !(0 != #t~nondet5) [L1010] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1016] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1017] FCALL call #t~malloc6 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1017] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem7!base=30, #t~mem7!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] FCALL call write~$Pointer$(~end~0, { base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem7!base=30, #t~mem7!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1019] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem8!base=30, #t~mem8!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1019] ~end~0 := #t~mem8; [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1020] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1021] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~nondet1=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem10=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem13!base=31, #t~mem13!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] COND FALSE !(#t~mem13 == { base: 0, offset: 0 }) [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1041] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem14!base=31, #t~mem14!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1041] ~end~0 := #t~mem14; [L1041] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem10=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem10 [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1036] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem11!base=30, #t~mem11!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1036] ~end~0 := #t~mem11; [L1036] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1037] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem12!base=0, #t~mem12!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1037] ~end~0 := #t~mem12; [L1037] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=13, old(#NULL!base)=22, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L995] 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=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~nondet1=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002-L1023] COND FALSE !(!(0 != #t~nondet1)) [L1002] havoc #t~nondet1; [L1005] FCALL call #t~malloc2 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem3!base=31, #t~mem3!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1006] FCALL call write~$Pointer$(~end~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem3!base=31, #t~mem3!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1006] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1007] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~mem4!base=31, #t~mem4!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1007] ~end~0 := #t~mem4; [L1007] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1008] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1010] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~nondet5=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1010-L1022] COND FALSE !(0 != #t~nondet5) [L1010] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1016] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1017] FCALL call #t~malloc6 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1017] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem7!base=30, #t~mem7!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] FCALL call write~$Pointer$(~end~0, { base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem7!base=30, #t~mem7!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1018] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1019] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem8!base=30, #t~mem8!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1019] ~end~0 := #t~mem8; [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1020] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1021] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~nondet1=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem10=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem13!base=31, #t~mem13!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] COND FALSE !(#t~mem13 == { base: 0, offset: 0 }) [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1041] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem14!base=31, #t~mem14!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1041] ~end~0 := #t~mem14; [L1041] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem10=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem10 [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1036] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem11!base=30, #t~mem11!offset=0, ~end~0!base=31, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1036] ~end~0 := #t~mem11; [L1036] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1037] 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, #t~mem12!base=0, #t~mem12!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1037] ~end~0 := #t~mem12; [L1037] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := 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=26, #t~malloc0!offset=0, #t~malloc2!base=31, #t~malloc2!offset=0, #t~malloc6!base=30, #t~malloc6!offset=0, ~end~0!base=0, ~end~0!offset=0, ~list~0!base=26, ~list~0!offset=0] [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L995] list->next = ((void*)0) VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L996] list->prev = ((void*)0) VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L997] list->colour = BLACK VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L999] SLL* end = list; VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={26:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1006] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1006] end->next->prev = end VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1007] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1007] end = end->next [L1008] end->next = ((void*)0) VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] end->colour = RED VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1017] end->next = malloc(sizeof(SLL)) VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1018] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1018] end->next->prev = end VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1019] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1019] end = end->next [L1020] end->next = ((void*)0) VAL [end={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1021] end->colour = BLACK VAL [end={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1030] EXPR end->colour VAL [end={26:0}, end->colour=1, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] EXPR end->colour VAL [end={26:0}, end->colour=1, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1040] COND FALSE !(!(end->next)) [L1041] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] EXPR end->colour VAL [end={31:0}, end->colour=0, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1036] end = end->next [L1037] EXPR end->next VAL [end={30:0}, end->next={0:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1037] end = end->next [L1040] end->next ----- [2018-11-23 14:46:12,273 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d3e4063b-dce0-42f9-aa66-7cdee7f44092/bin-2019/uautomizer/witness.graphml [2018-11-23 14:46:12,273 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:46:12,274 INFO L168 Benchmark]: Toolchain (without parser) took 34010.91 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 451.4 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -108.8 MB). Peak memory consumption was 342.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:46:12,274 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:46:12,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:46:12,275 INFO L168 Benchmark]: Boogie Preprocessor took 43.42 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:46:12,275 INFO L168 Benchmark]: RCFGBuilder took 496.82 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: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:46:12,275 INFO L168 Benchmark]: TraceAbstraction took 32681.99 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 309.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.7 MB). Peak memory consumption was 305.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:46:12,275 INFO L168 Benchmark]: Witness Printer took 430.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-23 14:46:12,276 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.42 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 496.82 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: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32681.99 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 309.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.7 MB). Peak memory consumption was 305.1 MB. Max. memory is 11.5 GB. * Witness Printer took 430.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L995] list->next = ((void*)0) VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L996] list->prev = ((void*)0) VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L997] list->colour = BLACK VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L999] SLL* end = list; VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={26:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1006] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1006] end->next->prev = end VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1007] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1007] end = end->next [L1008] end->next = ((void*)0) VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] end->colour = RED VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1017] end->next = malloc(sizeof(SLL)) VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1018] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1018] end->next->prev = end VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1019] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1019] end = end->next [L1020] end->next = ((void*)0) VAL [end={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1021] end->colour = BLACK VAL [end={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1030] EXPR end->colour VAL [end={26:0}, end->colour=1, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] EXPR end->colour VAL [end={26:0}, end->colour=1, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1040] COND FALSE !(!(end->next)) [L1041] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] EXPR end->colour VAL [end={31:0}, end->colour=0, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1036] end = end->next [L1037] EXPR end->next VAL [end={30:0}, end->next={0:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={26:0}] [L1037] end = end->next [L1040] end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 129 locations, 59 error locations. UNSAFE Result, 32.6s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 18.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1575 SDtfs, 5012 SDslu, 7997 SDs, 0 SdLazy, 16885 SolverSat, 1144 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1055 GetRequests, 361 SyntacticMatches, 46 SemanticMatches, 648 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7451 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=25, 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, 26 MinimizatonAttempts, 861 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 1356 NumberOfCodeBlocks, 1356 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1265 ConstructedInterpolants, 236 QuantifiedInterpolants, 1566011 SizeOfPredicates, 189 NumberOfNonLiveVariables, 2242 ConjunctsInSsa, 519 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 24/167 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...