./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01_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_f7098a0f-d56b-4e41-884a-9424df13b283/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/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 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 03:25:45,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:25:45,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:25:45,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:25:45,123 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:25:45,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:25:45,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:25:45,127 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:25:45,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:25:45,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:25:45,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:25:45,131 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:25:45,131 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:25:45,132 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:25:45,133 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:25:45,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:25:45,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:25:45,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:25:45,138 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:25:45,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:25:45,140 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:25:45,141 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:25:45,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:25:45,143 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:25:45,143 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:25:45,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:25:45,145 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:25:45,146 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:25:45,147 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:25:45,148 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:25:45,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:25:45,149 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:25:45,149 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:25:45,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:25:45,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:25:45,150 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:25:45,150 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 03:25:45,160 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:25:45,160 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:25:45,160 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:25:45,161 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:25:45,161 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:25:45,161 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:25:45,161 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:25:45,162 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:25:45,162 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:25:45,162 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:25:45,162 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:25:45,162 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:25:45,162 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:25:45,163 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 03:25:45,163 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 03:25:45,163 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 03:25:45,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:25:45,163 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:25:45,163 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:25:45,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:25:45,164 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:25:45,164 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:25:45,164 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:25:45,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:25:45,164 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:25:45,165 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:25:45,165 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:25:45,165 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:25:45,165 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_f7098a0f-d56b-4e41-884a-9424df13b283/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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-11-23 03:25:45,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:25:45,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:25:45,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:25:45,207 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:25:45,207 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:25:45,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-23 03:25:45,253 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/bin-2019/uautomizer/data/f8ab57aeb/11322f6c59834fd0a406fab88023dfb7/FLAG84b32404e [2018-11-23 03:25:45,667 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:25:45,667 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-23 03:25:45,676 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/bin-2019/uautomizer/data/f8ab57aeb/11322f6c59834fd0a406fab88023dfb7/FLAG84b32404e [2018-11-23 03:25:46,037 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/bin-2019/uautomizer/data/f8ab57aeb/11322f6c59834fd0a406fab88023dfb7 [2018-11-23 03:25:46,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:25:46,041 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 03:25:46,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:25:46,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:25:46,046 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:25:46,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:25:46" (1/1) ... [2018-11-23 03:25:46,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8583ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:25:46, skipping insertion in model container [2018-11-23 03:25:46,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:25:46" (1/1) ... [2018-11-23 03:25:46,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:25:46,092 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:25:46,349 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:25:46,356 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:25:46,453 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:25:46,491 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:25:46,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:25:46 WrapperNode [2018-11-23 03:25:46,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:25:46,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:25:46,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:25:46,492 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:25:46,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:25:46" (1/1) ... [2018-11-23 03:25:46,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:25:46" (1/1) ... [2018-11-23 03:25:46,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:25:46" (1/1) ... [2018-11-23 03:25:46,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:25:46" (1/1) ... [2018-11-23 03:25:46,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:25:46" (1/1) ... [2018-11-23 03:25:46,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:25:46" (1/1) ... [2018-11-23 03:25:46,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:25:46" (1/1) ... [2018-11-23 03:25:46,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:25:46,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:25:46,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:25:46,564 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:25:46,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:25:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/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 03:25:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:25:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:25:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:25:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-23 03:25:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-23 03:25:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-23 03:25:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-23 03:25:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-23 03:25:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-23 03:25:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-23 03:25:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-23 03:25:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-23 03:25:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-23 03:25:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-23 03:25:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-23 03:25:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-23 03:25:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-23 03:25:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-23 03:25:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-23 03:25:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-23 03:25:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-23 03:25:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-23 03:25:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-23 03:25:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-23 03:25:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-23 03:25:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-23 03:25:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-23 03:25:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-23 03:25:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-23 03:25:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-23 03:25:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-23 03:25:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-23 03:25:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-23 03:25:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-23 03:25:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-23 03:25:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-23 03:25:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-23 03:25:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-23 03:25:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-23 03:25:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-23 03:25:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-23 03:25:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-23 03:25:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-23 03:25:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-23 03:25:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-23 03:25:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-23 03:25:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-23 03:25:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-23 03:25:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-23 03:25:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-23 03:25:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-23 03:25:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-23 03:25:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-23 03:25:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-23 03:25:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-23 03:25:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-23 03:25:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-23 03:25:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-23 03:25:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-23 03:25:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-23 03:25:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-23 03:25:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-23 03:25:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-23 03:25:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-23 03:25:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-23 03:25:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-23 03:25:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 03:25:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-23 03:25:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-23 03:25:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-23 03:25:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-23 03:25:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-23 03:25:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-23 03:25:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-23 03:25:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-23 03:25:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-23 03:25:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-23 03:25:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-23 03:25:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-23 03:25:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-23 03:25:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-23 03:25:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-23 03:25:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-23 03:25:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-23 03:25:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-23 03:25:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-23 03:25:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-23 03:25:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-23 03:25:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-23 03:25:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-23 03:25:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-23 03:25:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-23 03:25:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-23 03:25:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-23 03:25:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-23 03:25:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-23 03:25:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-23 03:25:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-23 03:25:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-23 03:25:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-23 03:25:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-23 03:25:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-23 03:25:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-23 03:25:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-23 03:25:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-23 03:25:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-23 03:25:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-23 03:25:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-23 03:25:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:25:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:25:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 03:25:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 03:25:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:25:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:25:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:25:47,322 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:25:47,322 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-11-23 03:25:47,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:25:47 BoogieIcfgContainer [2018-11-23 03:25:47,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:25:47,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:25:47,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:25:47,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:25:47,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:25:46" (1/3) ... [2018-11-23 03:25:47,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4764ee77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:25:47, skipping insertion in model container [2018-11-23 03:25:47,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:25:46" (2/3) ... [2018-11-23 03:25:47,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4764ee77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:25:47, skipping insertion in model container [2018-11-23 03:25:47,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:25:47" (3/3) ... [2018-11-23 03:25:47,333 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-11-23 03:25:47,345 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:25:47,353 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-11-23 03:25:47,371 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-11-23 03:25:47,399 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:25:47,400 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:25:47,400 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 03:25:47,401 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:25:47,401 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:25:47,401 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:25:47,401 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:25:47,401 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:25:47,401 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:25:47,423 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states. [2018-11-23 03:25:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 03:25:47,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:47,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:47,433 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:47,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:47,438 INFO L82 PathProgramCache]: Analyzing trace with hash -184166559, now seen corresponding path program 1 times [2018-11-23 03:25:47,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:47,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:47,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:47,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:47,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:47,577 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 03:25:47,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:47,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:25:47,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:25:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:25:47,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:25:47,595 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 3 states. [2018-11-23 03:25:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:47,833 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-11-23 03:25:47,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:25:47,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 03:25:47,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:47,844 INFO L225 Difference]: With dead ends: 168 [2018-11-23 03:25:47,844 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 03:25:47,846 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 03:25:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 03:25:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2018-11-23 03:25:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 03:25:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2018-11-23 03:25:47,890 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 7 [2018-11-23 03:25:47,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:47,891 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2018-11-23 03:25:47,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:25:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2018-11-23 03:25:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 03:25:47,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:47,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:47,892 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:47,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash -184166558, now seen corresponding path program 1 times [2018-11-23 03:25:47,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:47,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:47,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:47,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:47,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:47,957 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 03:25:47,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:47,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:25:47,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:25:47,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:25:47,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:25:47,960 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand 3 states. [2018-11-23 03:25:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:48,143 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2018-11-23 03:25:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:25:48,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 03:25:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:48,146 INFO L225 Difference]: With dead ends: 179 [2018-11-23 03:25:48,146 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 03:25:48,147 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 03:25:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 03:25:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 168. [2018-11-23 03:25:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 03:25:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-11-23 03:25:48,159 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 7 [2018-11-23 03:25:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:48,159 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-11-23 03:25:48,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:25:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-11-23 03:25:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 03:25:48,160 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:48,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:48,162 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:48,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:48,163 INFO L82 PathProgramCache]: Analyzing trace with hash 712155735, now seen corresponding path program 1 times [2018-11-23 03:25:48,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:48,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:48,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:48,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:48,248 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 03:25:48,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:48,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:25:48,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:25:48,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:25:48,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:25:48,249 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 5 states. [2018-11-23 03:25:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:48,557 INFO L93 Difference]: Finished difference Result 288 states and 317 transitions. [2018-11-23 03:25:48,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:25:48,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 03:25:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:48,559 INFO L225 Difference]: With dead ends: 288 [2018-11-23 03:25:48,559 INFO L226 Difference]: Without dead ends: 288 [2018-11-23 03:25:48,559 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 03:25:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-23 03:25:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 167. [2018-11-23 03:25:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-23 03:25:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-11-23 03:25:48,568 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 14 [2018-11-23 03:25:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:48,569 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-11-23 03:25:48,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:25:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-11-23 03:25:48,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 03:25:48,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:48,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:48,570 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:48,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:48,570 INFO L82 PathProgramCache]: Analyzing trace with hash 712155736, now seen corresponding path program 1 times [2018-11-23 03:25:48,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:48,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:48,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:48,637 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 03:25:48,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:48,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:25:48,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:25:48,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:25:48,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:25:48,638 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 5 states. [2018-11-23 03:25:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:48,929 INFO L93 Difference]: Finished difference Result 311 states and 350 transitions. [2018-11-23 03:25:48,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:25:48,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 03:25:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:48,931 INFO L225 Difference]: With dead ends: 311 [2018-11-23 03:25:48,931 INFO L226 Difference]: Without dead ends: 311 [2018-11-23 03:25:48,931 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 03:25:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-23 03:25:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 166. [2018-11-23 03:25:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 03:25:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 186 transitions. [2018-11-23 03:25:48,940 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 186 transitions. Word has length 14 [2018-11-23 03:25:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:48,941 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 186 transitions. [2018-11-23 03:25:48,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:25:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 186 transitions. [2018-11-23 03:25:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 03:25:48,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:48,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:48,942 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:48,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:48,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1306930890, now seen corresponding path program 1 times [2018-11-23 03:25:48,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:48,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:48,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:48,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:49,059 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 03:25:49,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:49,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:25:49,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 03:25:49,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 03:25:49,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:25:49,059 INFO L87 Difference]: Start difference. First operand 166 states and 186 transitions. Second operand 8 states. [2018-11-23 03:25:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:49,462 INFO L93 Difference]: Finished difference Result 290 states and 317 transitions. [2018-11-23 03:25:49,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:25:49,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 03:25:49,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:49,464 INFO L225 Difference]: With dead ends: 290 [2018-11-23 03:25:49,464 INFO L226 Difference]: Without dead ends: 290 [2018-11-23 03:25:49,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:25:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-23 03:25:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 165. [2018-11-23 03:25:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 03:25:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2018-11-23 03:25:49,468 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 17 [2018-11-23 03:25:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:49,468 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2018-11-23 03:25:49,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 03:25:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2018-11-23 03:25:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 03:25:49,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:49,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:49,469 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:49,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1306930889, now seen corresponding path program 1 times [2018-11-23 03:25:49,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:49,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:49,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:49,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:49,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:49,573 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 03:25:49,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:49,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:25:49,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 03:25:49,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 03:25:49,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:25:49,574 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand 8 states. [2018-11-23 03:25:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:50,078 INFO L93 Difference]: Finished difference Result 291 states and 318 transitions. [2018-11-23 03:25:50,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:25:50,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 03:25:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:50,080 INFO L225 Difference]: With dead ends: 291 [2018-11-23 03:25:50,080 INFO L226 Difference]: Without dead ends: 291 [2018-11-23 03:25:50,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:25:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-23 03:25:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 164. [2018-11-23 03:25:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 03:25:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 184 transitions. [2018-11-23 03:25:50,085 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 184 transitions. Word has length 17 [2018-11-23 03:25:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:50,085 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 184 transitions. [2018-11-23 03:25:50,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 03:25:50,085 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 184 transitions. [2018-11-23 03:25:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 03:25:50,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:50,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:50,086 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:50,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1193006862, now seen corresponding path program 1 times [2018-11-23 03:25:50,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:50,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:50,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:50,127 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 03:25:50,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:50,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:25:50,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:25:50,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:25:50,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:25:50,128 INFO L87 Difference]: Start difference. First operand 164 states and 184 transitions. Second operand 5 states. [2018-11-23 03:25:50,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:50,221 INFO L93 Difference]: Finished difference Result 243 states and 269 transitions. [2018-11-23 03:25:50,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:25:50,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 03:25:50,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:50,222 INFO L225 Difference]: With dead ends: 243 [2018-11-23 03:25:50,222 INFO L226 Difference]: Without dead ends: 243 [2018-11-23 03:25:50,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 03:25:50,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-23 03:25:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 167. [2018-11-23 03:25:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-23 03:25:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-11-23 03:25:50,236 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 21 [2018-11-23 03:25:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:50,236 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-11-23 03:25:50,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:25:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-11-23 03:25:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 03:25:50,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:50,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:50,237 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:50,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:50,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1345659283, now seen corresponding path program 1 times [2018-11-23 03:25:50,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:50,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:50,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:50,290 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 03:25:50,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:50,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:25:50,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 03:25:50,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:25:50,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:25:50,291 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 4 states. [2018-11-23 03:25:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:50,402 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2018-11-23 03:25:50,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:25:50,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 03:25:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:50,404 INFO L225 Difference]: With dead ends: 169 [2018-11-23 03:25:50,404 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 03:25:50,404 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 03:25:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 03:25:50,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2018-11-23 03:25:50,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 03:25:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2018-11-23 03:25:50,406 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 23 [2018-11-23 03:25:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:50,406 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2018-11-23 03:25:50,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 03:25:50,407 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2018-11-23 03:25:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 03:25:50,407 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:50,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:50,407 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:50,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:50,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1345659284, now seen corresponding path program 1 times [2018-11-23 03:25:50,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:50,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:50,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:50,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:50,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:50,466 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 03:25:50,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:50,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:25:50,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 03:25:50,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:25:50,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:25:50,467 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand 6 states. [2018-11-23 03:25:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:50,631 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-11-23 03:25:50,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:25:50,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 03:25:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:50,633 INFO L225 Difference]: With dead ends: 207 [2018-11-23 03:25:50,633 INFO L226 Difference]: Without dead ends: 207 [2018-11-23 03:25:50,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:25:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-23 03:25:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2018-11-23 03:25:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-23 03:25:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 212 transitions. [2018-11-23 03:25:50,636 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 212 transitions. Word has length 23 [2018-11-23 03:25:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:50,636 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 212 transitions. [2018-11-23 03:25:50,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 03:25:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 212 transitions. [2018-11-23 03:25:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 03:25:50,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:50,637 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 03:25:50,638 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:50,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:50,638 INFO L82 PathProgramCache]: Analyzing trace with hash -688979348, now seen corresponding path program 1 times [2018-11-23 03:25:50,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:50,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:50,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:50,680 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 03:25:50,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:50,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:25:50,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 03:25:50,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:25:50,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:25:50,681 INFO L87 Difference]: Start difference. First operand 181 states and 212 transitions. Second operand 6 states. [2018-11-23 03:25:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:50,871 INFO L93 Difference]: Finished difference Result 262 states and 310 transitions. [2018-11-23 03:25:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:25:50,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-23 03:25:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:50,872 INFO L225 Difference]: With dead ends: 262 [2018-11-23 03:25:50,872 INFO L226 Difference]: Without dead ends: 262 [2018-11-23 03:25:50,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 03:25:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-23 03:25:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 180. [2018-11-23 03:25:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 03:25:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 211 transitions. [2018-11-23 03:25:50,875 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 211 transitions. Word has length 26 [2018-11-23 03:25:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:50,876 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 211 transitions. [2018-11-23 03:25:50,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 03:25:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 211 transitions. [2018-11-23 03:25:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 03:25:50,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:50,876 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 03:25:50,877 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:50,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:50,877 INFO L82 PathProgramCache]: Analyzing trace with hash -688979347, now seen corresponding path program 1 times [2018-11-23 03:25:50,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:50,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:50,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:50,933 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 03:25:50,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:50,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:25:50,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 03:25:50,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:25:50,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:25:50,934 INFO L87 Difference]: Start difference. First operand 180 states and 211 transitions. Second operand 6 states. [2018-11-23 03:25:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:51,144 INFO L93 Difference]: Finished difference Result 278 states and 334 transitions. [2018-11-23 03:25:51,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:25:51,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-23 03:25:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:51,145 INFO L225 Difference]: With dead ends: 278 [2018-11-23 03:25:51,145 INFO L226 Difference]: Without dead ends: 278 [2018-11-23 03:25:51,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:25:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-11-23 03:25:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 167. [2018-11-23 03:25:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-23 03:25:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2018-11-23 03:25:51,149 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 26 [2018-11-23 03:25:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:51,150 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2018-11-23 03:25:51,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 03:25:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2018-11-23 03:25:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 03:25:51,150 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:51,151 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] [2018-11-23 03:25:51,151 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:51,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1556935949, now seen corresponding path program 1 times [2018-11-23 03:25:51,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:51,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:51,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:51,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:51,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:51,198 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 03:25:51,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:51,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:25:51,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 03:25:51,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:25:51,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:25:51,199 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. Second operand 4 states. [2018-11-23 03:25:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:51,260 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2018-11-23 03:25:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:25:51,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-23 03:25:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:51,261 INFO L225 Difference]: With dead ends: 188 [2018-11-23 03:25:51,261 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 03:25:51,261 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 03:25:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 03:25:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 167. [2018-11-23 03:25:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-23 03:25:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2018-11-23 03:25:51,264 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 29 [2018-11-23 03:25:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:51,265 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2018-11-23 03:25:51,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 03:25:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2018-11-23 03:25:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 03:25:51,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:51,266 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, 1, 1, 1] [2018-11-23 03:25:51,266 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:51,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:51,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1570211192, now seen corresponding path program 1 times [2018-11-23 03:25:51,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:51,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:51,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:51,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:51,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:51,343 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 03:25:51,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:51,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 03:25:51,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 03:25:51,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 03:25:51,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:25:51,344 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand 8 states. [2018-11-23 03:25:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:51,597 INFO L93 Difference]: Finished difference Result 254 states and 290 transitions. [2018-11-23 03:25:51,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 03:25:51,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 03:25:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:51,598 INFO L225 Difference]: With dead ends: 254 [2018-11-23 03:25:51,598 INFO L226 Difference]: Without dead ends: 254 [2018-11-23 03:25:51,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-23 03:25:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-23 03:25:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 179. [2018-11-23 03:25:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-23 03:25:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2018-11-23 03:25:51,603 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 33 [2018-11-23 03:25:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:51,603 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2018-11-23 03:25:51,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 03:25:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2018-11-23 03:25:51,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 03:25:51,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:51,605 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] [2018-11-23 03:25:51,605 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:51,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:51,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1966241453, now seen corresponding path program 1 times [2018-11-23 03:25:51,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:51,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:51,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:51,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:51,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:25:51,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:25:51,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/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 03:25:51,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:51,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:25:51,757 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 03:25:51,759 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 03:25:51,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,766 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 03:25:51,767 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 03:25:51,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-11-23 03:25:51,791 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 21 treesize of output 16 [2018-11-23 03:25:51,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:51,796 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 16 treesize of output 23 [2018-11-23 03:25:51,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,814 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 21 treesize of output 16 [2018-11-23 03:25:51,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:51,816 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 16 treesize of output 23 [2018-11-23 03:25:51,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-23 03:25:51,865 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 24 treesize of output 18 [2018-11-23 03:25:51,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:51,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 03:25:51,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,881 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 24 treesize of output 18 [2018-11-23 03:25:51,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:51,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 03:25:51,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,892 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 03:25:51,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-11-23 03:25:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:25:51,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:25:51,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-11-23 03:25:51,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 03:25:51,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 03:25:51,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:25:51,917 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand 10 states. [2018-11-23 03:25:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:52,217 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2018-11-23 03:25:52,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 03:25:52,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 03:25:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:52,218 INFO L225 Difference]: With dead ends: 289 [2018-11-23 03:25:52,219 INFO L226 Difference]: Without dead ends: 289 [2018-11-23 03:25:52,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-11-23 03:25:52,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-23 03:25:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 207. [2018-11-23 03:25:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-23 03:25:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2018-11-23 03:25:52,224 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 35 [2018-11-23 03:25:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:52,224 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2018-11-23 03:25:52,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 03:25:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2018-11-23 03:25:52,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 03:25:52,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:52,228 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, 1, 1, 1, 1, 1] [2018-11-23 03:25:52,228 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:52,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:52,228 INFO L82 PathProgramCache]: Analyzing trace with hash 405098964, now seen corresponding path program 1 times [2018-11-23 03:25:52,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:52,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:52,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:52,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:52,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:52,265 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 03:25:52,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:52,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:25:52,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:25:52,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:25:52,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:25:52,266 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand 5 states. [2018-11-23 03:25:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:52,417 INFO L93 Difference]: Finished difference Result 305 states and 365 transitions. [2018-11-23 03:25:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:25:52,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 03:25:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:52,419 INFO L225 Difference]: With dead ends: 305 [2018-11-23 03:25:52,419 INFO L226 Difference]: Without dead ends: 305 [2018-11-23 03:25:52,419 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 03:25:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-23 03:25:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 206. [2018-11-23 03:25:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-23 03:25:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-11-23 03:25:52,423 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 35 [2018-11-23 03:25:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:52,424 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-11-23 03:25:52,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:25:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-11-23 03:25:52,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 03:25:52,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:52,425 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, 1, 1, 1, 1, 1] [2018-11-23 03:25:52,425 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:52,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:52,425 INFO L82 PathProgramCache]: Analyzing trace with hash 405098965, now seen corresponding path program 1 times [2018-11-23 03:25:52,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:52,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:52,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:52,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:52,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:52,481 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 03:25:52,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:52,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:25:52,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:25:52,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:25:52,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:25:52,482 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 5 states. [2018-11-23 03:25:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:52,657 INFO L93 Difference]: Finished difference Result 331 states and 398 transitions. [2018-11-23 03:25:52,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:25:52,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 03:25:52,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:52,659 INFO L225 Difference]: With dead ends: 331 [2018-11-23 03:25:52,659 INFO L226 Difference]: Without dead ends: 331 [2018-11-23 03:25:52,660 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 03:25:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-23 03:25:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 205. [2018-11-23 03:25:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-23 03:25:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 246 transitions. [2018-11-23 03:25:52,663 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 246 transitions. Word has length 35 [2018-11-23 03:25:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:52,663 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 246 transitions. [2018-11-23 03:25:52,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:25:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 246 transitions. [2018-11-23 03:25:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 03:25:52,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:52,664 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:52,665 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:52,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:52,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1264619924, now seen corresponding path program 1 times [2018-11-23 03:25:52,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:52,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:52,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:52,781 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 03:25:52,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:52,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 03:25:52,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 03:25:52,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 03:25:52,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:25:52,782 INFO L87 Difference]: Start difference. First operand 205 states and 246 transitions. Second operand 11 states. [2018-11-23 03:25:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:53,311 INFO L93 Difference]: Finished difference Result 393 states and 445 transitions. [2018-11-23 03:25:53,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 03:25:53,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 03:25:53,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:53,314 INFO L225 Difference]: With dead ends: 393 [2018-11-23 03:25:53,314 INFO L226 Difference]: Without dead ends: 393 [2018-11-23 03:25:53,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-11-23 03:25:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-11-23 03:25:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 208. [2018-11-23 03:25:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-23 03:25:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2018-11-23 03:25:53,323 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 37 [2018-11-23 03:25:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:53,323 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2018-11-23 03:25:53,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 03:25:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2018-11-23 03:25:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 03:25:53,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:53,324 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:53,324 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:53,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:53,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1264619923, now seen corresponding path program 1 times [2018-11-23 03:25:53,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:53,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:53,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:53,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:53,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:53,536 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 03:25:53,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:53,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 03:25:53,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 03:25:53,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 03:25:53,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:25:53,537 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand 11 states. [2018-11-23 03:25:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:54,212 INFO L93 Difference]: Finished difference Result 437 states and 490 transitions. [2018-11-23 03:25:54,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 03:25:54,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 03:25:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:54,213 INFO L225 Difference]: With dead ends: 437 [2018-11-23 03:25:54,213 INFO L226 Difference]: Without dead ends: 437 [2018-11-23 03:25:54,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-11-23 03:25:54,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-11-23 03:25:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 214. [2018-11-23 03:25:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-23 03:25:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 253 transitions. [2018-11-23 03:25:54,218 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 253 transitions. Word has length 37 [2018-11-23 03:25:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:54,218 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 253 transitions. [2018-11-23 03:25:54,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 03:25:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 253 transitions. [2018-11-23 03:25:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 03:25:54,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:54,219 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:54,219 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:54,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:54,220 INFO L82 PathProgramCache]: Analyzing trace with hash -554748027, now seen corresponding path program 1 times [2018-11-23 03:25:54,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:54,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:54,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:54,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:54,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:54,293 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 03:25:54,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:54,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:25:54,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 03:25:54,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 03:25:54,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:25:54,294 INFO L87 Difference]: Start difference. First operand 214 states and 253 transitions. Second operand 8 states. [2018-11-23 03:25:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:54,550 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2018-11-23 03:25:54,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:25:54,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 03:25:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:54,551 INFO L225 Difference]: With dead ends: 227 [2018-11-23 03:25:54,551 INFO L226 Difference]: Without dead ends: 227 [2018-11-23 03:25:54,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:25:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-23 03:25:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 213. [2018-11-23 03:25:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-23 03:25:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2018-11-23 03:25:54,555 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 38 [2018-11-23 03:25:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:54,555 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2018-11-23 03:25:54,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 03:25:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2018-11-23 03:25:54,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 03:25:54,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:54,556 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:54,556 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:54,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:54,556 INFO L82 PathProgramCache]: Analyzing trace with hash -554748026, now seen corresponding path program 1 times [2018-11-23 03:25:54,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:54,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:54,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:54,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:54,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:54,657 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 03:25:54,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:54,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:25:54,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 03:25:54,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 03:25:54,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:25:54,658 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand 8 states. [2018-11-23 03:25:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:54,936 INFO L93 Difference]: Finished difference Result 226 states and 267 transitions. [2018-11-23 03:25:54,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:25:54,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 03:25:54,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:54,938 INFO L225 Difference]: With dead ends: 226 [2018-11-23 03:25:54,938 INFO L226 Difference]: Without dead ends: 226 [2018-11-23 03:25:54,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:25:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-23 03:25:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2018-11-23 03:25:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-23 03:25:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 251 transitions. [2018-11-23 03:25:54,941 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 251 transitions. Word has length 38 [2018-11-23 03:25:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:54,941 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 251 transitions. [2018-11-23 03:25:54,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 03:25:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 251 transitions. [2018-11-23 03:25:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 03:25:54,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:54,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:54,942 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:54,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:54,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1645703445, now seen corresponding path program 1 times [2018-11-23 03:25:54,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:54,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:54,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:54,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:54,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:25:55,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:55,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:25:55,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 03:25:55,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:25:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:25:55,003 INFO L87 Difference]: Start difference. First operand 212 states and 251 transitions. Second operand 7 states. [2018-11-23 03:25:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:55,145 INFO L93 Difference]: Finished difference Result 226 states and 265 transitions. [2018-11-23 03:25:55,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:25:55,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-23 03:25:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:55,147 INFO L225 Difference]: With dead ends: 226 [2018-11-23 03:25:55,147 INFO L226 Difference]: Without dead ends: 226 [2018-11-23 03:25:55,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:25:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-23 03:25:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2018-11-23 03:25:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-23 03:25:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 260 transitions. [2018-11-23 03:25:55,150 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 260 transitions. Word has length 41 [2018-11-23 03:25:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:55,150 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 260 transitions. [2018-11-23 03:25:55,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 03:25:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 260 transitions. [2018-11-23 03:25:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 03:25:55,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:55,151 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] [2018-11-23 03:25:55,151 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:55,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:55,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1572806925, now seen corresponding path program 1 times [2018-11-23 03:25:55,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:55,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:55,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:55,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:55,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:25:55,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:25:55,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/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 03:25:55,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:55,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:25:55,329 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 13 treesize of output 10 [2018-11-23 03:25:55,331 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 10 treesize of output 9 [2018-11-23 03:25:55,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:55,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:55,346 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 13 treesize of output 10 [2018-11-23 03:25:55,348 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 10 treesize of output 9 [2018-11-23 03:25:55,348 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:55,351 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:55,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:55,355 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-23 03:25:55,571 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 24 treesize of output 18 [2018-11-23 03:25:55,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:55,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:55,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 03:25:55,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 03:25:55,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:25:55,631 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 24 treesize of output 18 [2018-11-23 03:25:55,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:55,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:55,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 03:25:55,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 03:25:55,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:25:55,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:25:55,658 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2018-11-23 03:25:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:25:55,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:25:55,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-11-23 03:25:55,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 03:25:55,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 03:25:55,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-23 03:25:55,728 INFO L87 Difference]: Start difference. First operand 221 states and 260 transitions. Second operand 17 states. [2018-11-23 03:25:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:56,792 INFO L93 Difference]: Finished difference Result 485 states and 528 transitions. [2018-11-23 03:25:56,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 03:25:56,793 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-11-23 03:25:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:56,794 INFO L225 Difference]: With dead ends: 485 [2018-11-23 03:25:56,794 INFO L226 Difference]: Without dead ends: 485 [2018-11-23 03:25:56,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 03:25:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-11-23 03:25:56,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 243. [2018-11-23 03:25:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-23 03:25:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 289 transitions. [2018-11-23 03:25:56,798 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 289 transitions. Word has length 44 [2018-11-23 03:25:56,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:56,798 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 289 transitions. [2018-11-23 03:25:56,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 03:25:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 289 transitions. [2018-11-23 03:25:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 03:25:56,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:56,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:56,798 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:56,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:56,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1512375263, now seen corresponding path program 1 times [2018-11-23 03:25:56,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:56,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:56,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:56,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:56,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:25:56,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:25:56,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/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 03:25:56,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:56,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:25:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:25:57,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:25:57,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 5 [2018-11-23 03:25:57,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 03:25:57,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:25:57,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2018-11-23 03:25:57,372 INFO L87 Difference]: Start difference. First operand 243 states and 289 transitions. Second operand 6 states. [2018-11-23 03:25:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:57,488 INFO L93 Difference]: Finished difference Result 273 states and 319 transitions. [2018-11-23 03:25:57,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:25:57,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-23 03:25:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:57,490 INFO L225 Difference]: With dead ends: 273 [2018-11-23 03:25:57,490 INFO L226 Difference]: Without dead ends: 250 [2018-11-23 03:25:57,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2018-11-23 03:25:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-23 03:25:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-11-23 03:25:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-23 03:25:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 296 transitions. [2018-11-23 03:25:57,495 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 296 transitions. Word has length 45 [2018-11-23 03:25:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:57,495 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 296 transitions. [2018-11-23 03:25:57,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 03:25:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 296 transitions. [2018-11-23 03:25:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 03:25:57,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:57,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:57,496 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:57,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:57,496 INFO L82 PathProgramCache]: Analyzing trace with hash 401679881, now seen corresponding path program 1 times [2018-11-23 03:25:57,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:57,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:57,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:57,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:57,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:25:57,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:57,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 03:25:57,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 03:25:57,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 03:25:57,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:25:57,620 INFO L87 Difference]: Start difference. First operand 250 states and 296 transitions. Second operand 10 states. [2018-11-23 03:25:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:58,034 INFO L93 Difference]: Finished difference Result 403 states and 466 transitions. [2018-11-23 03:25:58,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 03:25:58,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-23 03:25:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:58,036 INFO L225 Difference]: With dead ends: 403 [2018-11-23 03:25:58,036 INFO L226 Difference]: Without dead ends: 403 [2018-11-23 03:25:58,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-11-23 03:25:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-11-23 03:25:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 257. [2018-11-23 03:25:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-23 03:25:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2018-11-23 03:25:58,042 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 45 [2018-11-23 03:25:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:58,042 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2018-11-23 03:25:58,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 03:25:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2018-11-23 03:25:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 03:25:58,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:58,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:58,043 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:58,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:58,043 INFO L82 PathProgramCache]: Analyzing trace with hash 401679882, now seen corresponding path program 1 times [2018-11-23 03:25:58,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:58,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:58,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:58,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:58,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:25:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:25:58,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:25:58,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 03:25:58,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 03:25:58,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 03:25:58,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:25:58,200 INFO L87 Difference]: Start difference. First operand 257 states and 305 transitions. Second operand 10 states. [2018-11-23 03:25:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:25:58,573 INFO L93 Difference]: Finished difference Result 406 states and 470 transitions. [2018-11-23 03:25:58,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 03:25:58,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-23 03:25:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:25:58,574 INFO L225 Difference]: With dead ends: 406 [2018-11-23 03:25:58,574 INFO L226 Difference]: Without dead ends: 406 [2018-11-23 03:25:58,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-23 03:25:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-11-23 03:25:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 263. [2018-11-23 03:25:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-23 03:25:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 310 transitions. [2018-11-23 03:25:58,579 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 310 transitions. Word has length 45 [2018-11-23 03:25:58,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:25:58,579 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 310 transitions. [2018-11-23 03:25:58,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 03:25:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 310 transitions. [2018-11-23 03:25:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 03:25:58,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:25:58,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:25:58,580 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION]=== [2018-11-23 03:25:58,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:25:58,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1090480954, now seen corresponding path program 1 times [2018-11-23 03:25:58,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:25:58,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:25:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:58,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:25:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:25:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:25:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:25:58,620 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] RET #415#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret28 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-8 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem3.base|=11, |main_#t~mem3.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-9 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem3.base|=11, |main_#t~mem3.offset|=0] [?] havoc #t~mem3.base, #t~mem3.offset; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem4.base|=11, |main_#t~mem4.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-12 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem4.base|=11, |main_#t~mem4.offset|=0] [?] havoc #t~mem4.base, #t~mem4.offset; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-23 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=11, |main_#t~mem5.offset|=0] [?] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=11, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume #t~short7; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=11, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~nondet8|=0] [?] assume !(0 != #t~nondet8);havoc #t~nondet8; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.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=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~len~0=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~len~0=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem18.base|=11, |main_#t~mem18.offset|=0] [?] ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume 0 == ~len~0;~len~0 := 1; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-3 VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem19.base|=0, |main_#t~mem19.offset|=0] [?] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset);havoc #t~mem19.base, #t~mem19.offset; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); srcloc: L1026-3 VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem20.base|=0, |main_#t~mem20.offset|=0] [?] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1026-4 VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem21.base|=0, |main_#t~mem21.offset|=0] [?] ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset;havoc #t~mem21.base, #t~mem21.offset; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=0, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume 1 == ~len~0; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=0, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume !(1 == #valid[~inner~0.base]); VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=0, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L991] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L991] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L992] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem3.base=11, #t~mem3.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem3.base=11, #t~mem3.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem4.base=11, #t~mem4.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem4.base=11, #t~mem4.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~short7=true, ~list~0.base=10, ~list~0.offset=0] [L993] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~short7=true, ~list~0.base=10, ~list~0.offset=0] [L993] assume !!#t~short7; [L993] havoc #t~mem5.base, #t~mem5.offset; [L993] havoc #t~mem6.base, #t~mem6.offset; [L993] havoc #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L995] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L998-L1006] assume !(0 != #t~nondet8); [L998] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1008] ~end~0.base, ~end~0.offset := 0, 0; [L1009] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1012] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1014-L1034] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1016] ~len~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1017] call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem18.base=11, #t~mem18.offset=0, ~end~0.base=10, ~end~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1017] ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; [L1017] havoc #t~mem18.base, #t~mem18.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1020-L1023] assume 0 == ~len~0; [L1021] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem19.base=0, #t~mem19.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1025] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1026] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1026] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1026] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1027] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem21.base=0, #t~mem21.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1027] ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; [L1027] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1028-L1029] assume 1 == ~len~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1029] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L991] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L991] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L992] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem3.base=11, #t~mem3.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem3.base=11, #t~mem3.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem4.base=11, #t~mem4.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem4.base=11, #t~mem4.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~short7=true, ~list~0.base=10, ~list~0.offset=0] [L993] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~short7=true, ~list~0.base=10, ~list~0.offset=0] [L993] assume !!#t~short7; [L993] havoc #t~mem5.base, #t~mem5.offset; [L993] havoc #t~mem6.base, #t~mem6.offset; [L993] havoc #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L995] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L998-L1006] assume !(0 != #t~nondet8); [L998] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1008] ~end~0.base, ~end~0.offset := 0, 0; [L1009] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1012] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1014-L1034] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1016] ~len~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1017] call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem18.base=11, #t~mem18.offset=0, ~end~0.base=10, ~end~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1017] ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; [L1017] havoc #t~mem18.base, #t~mem18.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1020-L1023] assume 0 == ~len~0; [L1021] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem19.base=0, #t~mem19.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1025] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1026] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1026] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1026] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1027] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem21.base=0, #t~mem21.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1027] ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; [L1027] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1028-L1029] assume 1 == ~len~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1029] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L992] 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=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem3!base=11, #t~mem3!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem3!base=11, #t~mem3!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem4!base=11, #t~mem4!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem4!base=11, #t~mem4!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~short7=true, ~list~0!base=10, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~short7=true, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem5; [L993] havoc #t~mem6; [L993] havoc #t~short7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem18!base=11, #t~mem18!offset=0, ~end~0!base=10, ~end~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L992] 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=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem3!base=11, #t~mem3!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem3!base=11, #t~mem3!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem4!base=11, #t~mem4!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem4!base=11, #t~mem4!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~short7=true, ~list~0!base=10, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~short7=true, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem5; [L993] havoc #t~mem6; [L993] havoc #t~short7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem18!base=11, #t~mem18!offset=0, ~end~0!base=10, ~end~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) VAL [list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] list->inner->next = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] list->inner->inner = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={11:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR end->inner VAL [end={10:0}, end->inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={10:0}, inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1025] EXPR inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={10:0}, inner={11:0}, inner->next={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={10:0}, inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1029] inner->inner ----- [2018-11-23 03:25:58,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:25:58 BoogieIcfgContainer [2018-11-23 03:25:58,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:25:58,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:25:58,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:25:58,690 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:25:58,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:25:47" (3/4) ... [2018-11-23 03:25:58,693 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|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] RET #415#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret28 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-8 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem3.base|=11, |main_#t~mem3.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-9 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem3.base|=11, |main_#t~mem3.offset|=0] [?] havoc #t~mem3.base, #t~mem3.offset; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem4.base|=11, |main_#t~mem4.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-12 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem4.base|=11, |main_#t~mem4.offset|=0] [?] havoc #t~mem4.base, #t~mem4.offset; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-23 VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=11, |main_#t~mem5.offset|=0] [?] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=11, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume #t~short7; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=11, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~nondet8|=0] [?] assume !(0 != #t~nondet8);havoc #t~nondet8; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.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=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~len~0=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~len~0=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem18.base|=11, |main_#t~mem18.offset|=0] [?] ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume 0 == ~len~0;~len~0 := 1; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-3 VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem19.base|=0, |main_#t~mem19.offset|=0] [?] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset);havoc #t~mem19.base, #t~mem19.offset; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); srcloc: L1026-3 VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem20.base|=0, |main_#t~mem20.offset|=0] [?] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1026-4 VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0, |main_#t~mem21.base|=0, |main_#t~mem21.offset|=0] [?] ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset;havoc #t~mem21.base, #t~mem21.offset; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=0, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume 1 == ~len~0; VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=0, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] assume !(1 == #valid[~inner~0.base]); VAL [main_~end~0.base=10, main_~end~0.offset=0, main_~inner~0.base=0, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=10, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=11, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L991] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L991] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L992] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem3.base=11, #t~mem3.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem3.base=11, #t~mem3.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem4.base=11, #t~mem4.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem4.base=11, #t~mem4.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~short7=true, ~list~0.base=10, ~list~0.offset=0] [L993] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~short7=true, ~list~0.base=10, ~list~0.offset=0] [L993] assume !!#t~short7; [L993] havoc #t~mem5.base, #t~mem5.offset; [L993] havoc #t~mem6.base, #t~mem6.offset; [L993] havoc #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L995] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L998-L1006] assume !(0 != #t~nondet8); [L998] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1008] ~end~0.base, ~end~0.offset := 0, 0; [L1009] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1012] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1014-L1034] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1016] ~len~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1017] call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem18.base=11, #t~mem18.offset=0, ~end~0.base=10, ~end~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1017] ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; [L1017] havoc #t~mem18.base, #t~mem18.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1020-L1023] assume 0 == ~len~0; [L1021] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem19.base=0, #t~mem19.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1025] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1026] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1026] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1026] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1027] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem21.base=0, #t~mem21.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1027] ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; [L1027] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1028-L1029] assume 1 == ~len~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1029] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L991] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L991] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L992] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=10, ~list~0.offset=0] [L993] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem3.base=11, #t~mem3.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem3.base=11, #t~mem3.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem4.base=11, #t~mem4.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem4.base=11, #t~mem4.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, ~list~0.base=10, ~list~0.offset=0] [L993] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~short7=true, ~list~0.base=10, ~list~0.offset=0] [L993] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~short7=true, ~list~0.base=10, ~list~0.offset=0] [L993] assume !!#t~short7; [L993] havoc #t~mem5.base, #t~mem5.offset; [L993] havoc #t~mem6.base, #t~mem6.offset; [L993] havoc #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~list~0.base=10, ~list~0.offset=0] [L995] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L998-L1006] assume !(0 != #t~nondet8); [L998] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1008] ~end~0.base, ~end~0.offset := 0, 0; [L1009] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1012] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~list~0.base=10, ~list~0.offset=0] [L1014-L1034] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1016] ~len~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1017] call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem18.base=11, #t~mem18.offset=0, ~end~0.base=10, ~end~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1017] ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; [L1017] havoc #t~mem18.base, #t~mem18.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=0, ~list~0.base=10, ~list~0.offset=0] [L1020-L1023] assume 0 == ~len~0; [L1021] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem19.base=0, #t~mem19.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1025] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1026] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1026] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1026] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1027] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, #t~mem21.base=0, #t~mem21.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1027] ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; [L1027] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1028-L1029] assume 1 == ~len~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [L1029] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~malloc2.base=11, #t~malloc2.offset=0, ~end~0.base=10, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=10, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L992] 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=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem3!base=11, #t~mem3!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem3!base=11, #t~mem3!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem4!base=11, #t~mem4!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem4!base=11, #t~mem4!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~short7=true, ~list~0!base=10, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~short7=true, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem5; [L993] havoc #t~mem6; [L993] havoc #t~short7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem18!base=11, #t~mem18!offset=0, ~end~0!base=10, ~end~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L992] 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=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem3!base=11, #t~mem3!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem3!base=11, #t~mem3!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem4!base=11, #t~mem4!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem4!base=11, #t~mem4!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, ~list~0!base=10, ~list~0!offset=0] [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~short7=true, ~list~0!base=10, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~short7=true, ~list~0!base=10, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem5; [L993] havoc #t~mem6; [L993] havoc #t~short7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~list~0!base=10, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~list~0!base=10, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem18!base=11, #t~mem18!offset=0, ~end~0!base=10, ~end~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=0, ~list~0!base=10, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~malloc2!base=11, #t~malloc2!offset=0, ~end~0!base=10, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=10, ~list~0!offset=0] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) VAL [list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] list->inner->next = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] list->inner->inner = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={11:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR end->inner VAL [end={10:0}, end->inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={10:0}, inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1025] EXPR inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={10:0}, inner={11:0}, inner->next={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={10:0}, inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1029] inner->inner ----- [2018-11-23 03:25:58,942 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f7098a0f-d56b-4e41-884a-9424df13b283/bin-2019/uautomizer/witness.graphml [2018-11-23 03:25:58,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:25:58,943 INFO L168 Benchmark]: Toolchain (without parser) took 12903.31 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.2 MB). Free memory was 956.6 MB in the beginning and 887.3 MB in the end (delta: 69.3 MB). Peak memory consumption was 354.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:25:58,945 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:25:58,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 03:25:58,946 INFO L168 Benchmark]: Boogie Preprocessor took 71.64 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 03:25:58,946 INFO L168 Benchmark]: RCFGBuilder took 759.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.2 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:25:58,946 INFO L168 Benchmark]: TraceAbstraction took 11366.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.1 MB). Free memory was 1.0 GB in the beginning and 895.7 MB in the end (delta: 150.7 MB). Peak memory consumption was 303.8 MB. Max. memory is 11.5 GB. [2018-11-23 03:25:58,947 INFO L168 Benchmark]: Witness Printer took 252.67 ms. Allocated memory is still 1.3 GB. Free memory was 895.7 MB in the beginning and 887.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:25:58,949 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 449.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.64 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 759.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.2 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11366.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.1 MB). Free memory was 1.0 GB in the beginning and 895.7 MB in the end (delta: 150.7 MB). Peak memory consumption was 303.8 MB. Max. memory is 11.5 GB. * Witness Printer took 252.67 ms. Allocated memory is still 1.3 GB. Free memory was 895.7 MB in the beginning and 887.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) VAL [list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] list->inner->next = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] list->inner->inner = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={11:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR end->inner VAL [end={10:0}, end->inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={10:0}, inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1025] EXPR inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={10:0}, inner={11:0}, inner->next={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={10:0}, inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1029] inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 167 locations, 65 error locations. UNSAFE Result, 11.2s OverallTime, 26 OverallIterations, 2 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3340 SDtfs, 6490 SDslu, 10793 SDs, 0 SdLazy, 9438 SolverSat, 472 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 152 SyntacticMatches, 8 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred 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.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2215 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 828 ConstructedInterpolants, 10 QuantifiedInterpolants, 283503 SizeOfPredicates, 22 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 9/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...